./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe4506e3d5e012e1662dc0aa7741c8e3f8f99dc7c5ccf1f202c2f95071bfbf64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:52:29,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:52:29,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:52:29,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:52:29,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:52:29,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:52:29,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:52:29,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:52:29,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:52:29,141 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:52:29,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:52:29,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:52:29,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:52:29,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:52:29,142 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:52:29,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:52:29,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:52:29,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:52:29,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:52:29,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:52:29,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:52:29,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:52:29,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:52:29,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:52:29,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:52:29,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:52:29,143 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:52:29,143 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:52:29,143 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:52:29,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:29,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:29,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:29,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:29,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:52:29,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:29,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:29,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:29,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:29,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:52:29,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:52:29,144 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:52:29,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:52:29,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:52:29,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:52:29,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:52:29,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:52:29,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:52:29,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:52:29,144 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe4506e3d5e012e1662dc0aa7741c8e3f8f99dc7c5ccf1f202c2f95071bfbf64 [2025-01-09 03:52:29,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:52:29,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:52:29,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:52:29,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:52:29,362 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:52:29,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c [2025-01-09 03:52:30,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bed4a5fd/c0fb2b021eb1456aa6afa7d182ac8824/FLAGc2a8704a9 [2025-01-09 03:52:30,936 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:52:30,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c [2025-01-09 03:52:30,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bed4a5fd/c0fb2b021eb1456aa6afa7d182ac8824/FLAGc2a8704a9 [2025-01-09 03:52:31,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bed4a5fd/c0fb2b021eb1456aa6afa7d182ac8824 [2025-01-09 03:52:31,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:52:31,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:52:31,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:31,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:52:31,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:52:31,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78173795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31, skipping insertion in model container [2025-01-09 03:52:31,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:52:31,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c[11237,11250] [2025-01-09 03:52:31,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:31,789 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:52:31,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-01-09 03:52:31,798 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [414] [2025-01-09 03:52:31,798 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [423] [2025-01-09 03:52:31,798 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [441] [2025-01-09 03:52:31,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [561] [2025-01-09 03:52:31,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1641] [2025-01-09 03:52:31,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [1918] [2025-01-09 03:52:31,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1952] [2025-01-09 03:52:31,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2362] [2025-01-09 03:52:31,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2922] [2025-01-09 03:52:31,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [3271] [2025-01-09 03:52:31,818 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c[11237,11250] [2025-01-09 03:52:31,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:31,913 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:52:31,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31 WrapperNode [2025-01-09 03:52:31,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:31,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:31,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:52:31,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:52:31,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,979 INFO L138 Inliner]: procedures = 151, calls = 264, calls flagged for inlining = 66, calls inlined = 63, statements flattened = 1306 [2025-01-09 03:52:31,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:31,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:52:31,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:52:31,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:52:31,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:32,035 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:52:32,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:32,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:32,065 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:32,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:32,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:32,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:32,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:32,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:52:32,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:52:32,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:52:32,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:52:32,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:32,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:32,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:32,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:52:32,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:52:32,186 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:52:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:52:32,187 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-01-09 03:52:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-01-09 03:52:32,187 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-01-09 03:52:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-01-09 03:52:32,187 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:52:32,188 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:52:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:52:32,188 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:52:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:52:32,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:52:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:52:32,189 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:52:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-01-09 03:52:32,189 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-01-09 03:52:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:52:32,190 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:52:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-01-09 03:52:32,190 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-01-09 03:52:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:52:32,190 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:52:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:52:32,190 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:52:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:52:32,190 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:52:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-01-09 03:52:32,190 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-01-09 03:52:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-01-09 03:52:32,192 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-01-09 03:52:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:52:32,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:52:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:52:32,193 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:52:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:52:32,193 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:52:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-01-09 03:52:32,193 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-01-09 03:52:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:52:32,193 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:52:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:52:32,193 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:52:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:52:32,193 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:52:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-01-09 03:52:32,193 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-01-09 03:52:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:52:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:52:32,193 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:52:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:52:32,193 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:52:32,194 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-01-09 03:52:32,194 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-01-09 03:52:32,194 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-01-09 03:52:32,194 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-01-09 03:52:32,194 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-01-09 03:52:32,194 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-01-09 03:52:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:52:32,195 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:52:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:52:32,195 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:52:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:52:32,195 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:52:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:52:32,195 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:52:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-01-09 03:52:32,195 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-01-09 03:52:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:52:32,195 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:52:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:52:32,196 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:52:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:52:32,196 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:52:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-01-09 03:52:32,196 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-01-09 03:52:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-01-09 03:52:32,196 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-01-09 03:52:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:52:32,196 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:52:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:52:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:52:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:52:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:52:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:52:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:52:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:52:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:52:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-01-09 03:52:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-01-09 03:52:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-01-09 03:52:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-01-09 03:52:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:52:32,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:52:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:52:32,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:52:32,380 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:52:32,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:52:33,250 INFO L? ?]: Removed 625 outVars from TransFormulas that were not future-live. [2025-01-09 03:52:33,250 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:52:33,263 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:52:33,263 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:52:33,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:33 BoogieIcfgContainer [2025-01-09 03:52:33,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:52:33,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:52:33,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:52:33,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:52:33,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:52:31" (1/3) ... [2025-01-09 03:52:33,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169285e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:33, skipping insertion in model container [2025-01-09 03:52:33,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (2/3) ... [2025-01-09 03:52:33,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169285e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:33, skipping insertion in model container [2025-01-09 03:52:33,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:33" (3/3) ... [2025-01-09 03:52:33,274 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_productSimulator.cil.c [2025-01-09 03:52:33,285 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:52:33,289 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_productSimulator.cil.c that has 45 procedures, 607 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:52:33,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:52:33,374 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;@bb682bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:52:33,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:52:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 607 states, 449 states have (on average 1.512249443207127) internal successors, (679), 469 states have internal predecessors, (679), 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-01-09 03:52:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 03:52:33,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:33,404 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-01-09 03:52:33,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:33,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:33,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1174139647, now seen corresponding path program 1 times [2025-01-09 03:52:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:33,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179504328] [2025-01-09 03:52:33,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:33,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:33,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 03:52:33,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 03:52:33,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:33,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:52:33,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179504328] [2025-01-09 03:52:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179504328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:33,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:33,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:33,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283599760] [2025-01-09 03:52:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:33,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:33,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:34,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:34,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:34,011 INFO L87 Difference]: Start difference. First operand has 607 states, 449 states have (on average 1.512249443207127) internal successors, (679), 469 states have internal predecessors, (679), 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 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-01-09 03:52:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:34,161 INFO L93 Difference]: Finished difference Result 1177 states and 1768 transitions. [2025-01-09 03:52:34,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:34,164 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-01-09 03:52:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:34,180 INFO L225 Difference]: With dead ends: 1177 [2025-01-09 03:52:34,181 INFO L226 Difference]: Without dead ends: 600 [2025-01-09 03:52:34,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:34,193 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 0 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:34,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3575 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-01-09 03:52:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-01-09 03:52:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 443 states have (on average 1.4943566591422122) internal successors, (662), 462 states have internal predecessors, (662), 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-01-09 03:52:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 885 transitions. [2025-01-09 03:52:34,291 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 885 transitions. Word has length 158 [2025-01-09 03:52:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:34,295 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 885 transitions. [2025-01-09 03:52:34,295 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-01-09 03:52:34,295 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 885 transitions. [2025-01-09 03:52:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 03:52:34,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:34,303 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-01-09 03:52:34,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:52:34,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:34,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:34,305 INFO L85 PathProgramCache]: Analyzing trace with hash -92500821, now seen corresponding path program 1 times [2025-01-09 03:52:34,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:34,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571417393] [2025-01-09 03:52:34,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:34,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:34,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 03:52:34,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 03:52:34,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:34,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:52:34,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:34,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571417393] [2025-01-09 03:52:34,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571417393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:34,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:34,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:34,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757780371] [2025-01-09 03:52:34,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:34,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:34,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:34,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:34,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:34,556 INFO L87 Difference]: Start difference. First operand 600 states and 885 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-01-09 03:52:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:34,640 INFO L93 Difference]: Finished difference Result 1168 states and 1736 transitions. [2025-01-09 03:52:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:34,641 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-01-09 03:52:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:34,648 INFO L225 Difference]: With dead ends: 1168 [2025-01-09 03:52:34,648 INFO L226 Difference]: Without dead ends: 601 [2025-01-09 03:52:34,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:34,653 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 847 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 900 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-01-09 03:52:34,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 900 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-01-09 03:52:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-01-09 03:52:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 445 states have (on average 1.4853932584269662) internal successors, (661), 462 states have internal predecessors, (661), 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-01-09 03:52:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 880 transitions. [2025-01-09 03:52:34,699 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 880 transitions. Word has length 163 [2025-01-09 03:52:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:34,699 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 880 transitions. [2025-01-09 03:52:34,700 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-01-09 03:52:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 880 transitions. [2025-01-09 03:52:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 03:52:34,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:34,707 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] [2025-01-09 03:52:34,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:52:34,707 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:34,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:34,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1966256440, now seen corresponding path program 1 times [2025-01-09 03:52:34,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:34,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360911326] [2025-01-09 03:52:34,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:34,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:34,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 03:52:34,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 03:52:34,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:34,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:52:34,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:34,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360911326] [2025-01-09 03:52:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360911326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:34,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:34,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:34,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697873134] [2025-01-09 03:52:34,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:34,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:34,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:34,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:34,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:34,924 INFO L87 Difference]: Start difference. First operand 601 states and 880 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:35,021 INFO L93 Difference]: Finished difference Result 1715 states and 2547 transitions. [2025-01-09 03:52:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:35,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 177 [2025-01-09 03:52:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:35,029 INFO L225 Difference]: With dead ends: 1715 [2025-01-09 03:52:35,029 INFO L226 Difference]: Without dead ends: 1148 [2025-01-09 03:52:35,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:35,035 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 835 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1740 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-01-09 03:52:35,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1740 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:35,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-01-09 03:52:35,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1146. [2025-01-09 03:52:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 851 states have (on average 1.4923619271445359) internal successors, (1270), 881 states have internal predecessors, (1270), 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-01-09 03:52:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1691 transitions. [2025-01-09 03:52:35,111 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1691 transitions. Word has length 177 [2025-01-09 03:52:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:35,111 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1691 transitions. [2025-01-09 03:52:35,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1691 transitions. [2025-01-09 03:52:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 03:52:35,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:35,120 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-01-09 03:52:35,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:52:35,120 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:35,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1482470, now seen corresponding path program 1 times [2025-01-09 03:52:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:35,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435279845] [2025-01-09 03:52:35,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:35,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:35,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 03:52:35,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 03:52:35,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:35,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:52:35,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435279845] [2025-01-09 03:52:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435279845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:35,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:35,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112970849] [2025-01-09 03:52:35,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:35,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:35,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:35,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:35,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:35,226 INFO L87 Difference]: Start difference. First operand 1146 states and 1691 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-01-09 03:52:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:35,298 INFO L93 Difference]: Finished difference Result 1148 states and 1692 transitions. [2025-01-09 03:52:35,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:35,299 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-01-09 03:52:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:35,303 INFO L225 Difference]: With dead ends: 1148 [2025-01-09 03:52:35,305 INFO L226 Difference]: Without dead ends: 602 [2025-01-09 03:52:35,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:35,309 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 827 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 903 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-01-09 03:52:35,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 903 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-01-09 03:52:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2025-01-09 03:52:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 447 states have (on average 1.4742729306487696) internal successors, (659), 462 states have internal predecessors, (659), 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-01-09 03:52:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 874 transitions. [2025-01-09 03:52:35,349 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 874 transitions. Word has length 185 [2025-01-09 03:52:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:35,349 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 874 transitions. [2025-01-09 03:52:35,350 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-01-09 03:52:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 874 transitions. [2025-01-09 03:52:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 03:52:35,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:35,354 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, 1, 1] [2025-01-09 03:52:35,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:52:35,355 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:35,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:35,356 INFO L85 PathProgramCache]: Analyzing trace with hash -310514999, now seen corresponding path program 1 times [2025-01-09 03:52:35,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:35,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066839775] [2025-01-09 03:52:35,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:35,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:35,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 03:52:35,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 03:52:35,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:35,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:52:35,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:35,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066839775] [2025-01-09 03:52:35,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066839775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:35,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:35,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:35,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674502496] [2025-01-09 03:52:35,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:35,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:35,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:35,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:35,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:35,475 INFO L87 Difference]: Start difference. First operand 602 states and 874 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-01-09 03:52:35,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:35,568 INFO L93 Difference]: Finished difference Result 1158 states and 1688 transitions. [2025-01-09 03:52:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:35,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 187 [2025-01-09 03:52:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:35,572 INFO L225 Difference]: With dead ends: 1158 [2025-01-09 03:52:35,572 INFO L226 Difference]: Without dead ends: 605 [2025-01-09 03:52:35,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:35,574 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 809 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 888 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:35,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 888 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:35,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-01-09 03:52:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 599. [2025-01-09 03:52:35,597 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-01-09 03:52:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 857 transitions. [2025-01-09 03:52:35,601 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 857 transitions. Word has length 187 [2025-01-09 03:52:35,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:35,601 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 857 transitions. [2025-01-09 03:52:35,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-01-09 03:52:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 857 transitions. [2025-01-09 03:52:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 03:52:35,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:35,604 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] [2025-01-09 03:52:35,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:52:35,604 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:35,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash -97025354, now seen corresponding path program 1 times [2025-01-09 03:52:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:35,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425141026] [2025-01-09 03:52:35,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:35,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:35,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 03:52:35,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 03:52:35,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:35,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 03:52:35,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:35,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425141026] [2025-01-09 03:52:35,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425141026] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:35,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265063221] [2025-01-09 03:52:35,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:35,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:35,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:35,909 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:35,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:52:36,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 03:52:36,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 03:52:36,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:36,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:36,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 1587 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:52:36,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 03:52:36,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:36,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265063221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:52:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471884587] [2025-01-09 03:52:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:36,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:36,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:36,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:52:36,293 INFO L87 Difference]: Start difference. First operand 599 states and 857 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 03:52:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:36,328 INFO L93 Difference]: Finished difference Result 930 states and 1313 transitions. [2025-01-09 03:52:36,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:36,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 205 [2025-01-09 03:52:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:36,333 INFO L225 Difference]: With dead ends: 930 [2025-01-09 03:52:36,333 INFO L226 Difference]: Without dead ends: 601 [2025-01-09 03:52:36,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 205 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-01-09 03:52:36,334 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 1 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:36,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1700 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-01-09 03:52:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 600. [2025-01-09 03:52:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 448 states have (on average 1.4486607142857142) internal successors, (649), 458 states have internal predecessors, (649), 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-01-09 03:52:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 858 transitions. [2025-01-09 03:52:36,362 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 858 transitions. Word has length 205 [2025-01-09 03:52:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:36,363 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 858 transitions. [2025-01-09 03:52:36,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 03:52:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 858 transitions. [2025-01-09 03:52:36,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 03:52:36,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:36,365 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-01-09 03:52:36,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:36,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:36,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:36,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2116614305, now seen corresponding path program 1 times [2025-01-09 03:52:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027510281] [2025-01-09 03:52:36,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:36,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 03:52:36,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 03:52:36,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:36,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 03:52:36,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:36,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027510281] [2025-01-09 03:52:36,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027510281] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:36,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236518335] [2025-01-09 03:52:36,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:36,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:36,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:36,907 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:36,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:52:37,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 03:52:37,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 03:52:37,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:37,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:37,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1600 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:37,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 03:52:37,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:37,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236518335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:37,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:37,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:52:37,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856609089] [2025-01-09 03:52:37,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:37,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:37,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:37,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:37,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:52:37,303 INFO L87 Difference]: Start difference. First operand 600 states and 858 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 03:52:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:37,348 INFO L93 Difference]: Finished difference Result 1217 states and 1775 transitions. [2025-01-09 03:52:37,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:37,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 212 [2025-01-09 03:52:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:37,353 INFO L225 Difference]: With dead ends: 1217 [2025-01-09 03:52:37,353 INFO L226 Difference]: Without dead ends: 697 [2025-01-09 03:52:37,355 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-01-09 03:52:37,355 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 165 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:37,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1676 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-01-09 03:52:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 689. [2025-01-09 03:52:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 523 states have (on average 1.4646271510516253) internal successors, (766), 533 states have internal predecessors, (766), 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-01-09 03:52:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1003 transitions. [2025-01-09 03:52:37,405 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1003 transitions. Word has length 212 [2025-01-09 03:52:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:37,405 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1003 transitions. [2025-01-09 03:52:37,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 03:52:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1003 transitions. [2025-01-09 03:52:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 03:52:37,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:37,409 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, 1] [2025-01-09 03:52:37,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:52:37,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:37,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:37,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash 734273883, now seen corresponding path program 1 times [2025-01-09 03:52:37,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:37,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690713809] [2025-01-09 03:52:37,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:37,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:37,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 03:52:37,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 03:52:37,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:37,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-09 03:52:37,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:37,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690713809] [2025-01-09 03:52:37,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690713809] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:37,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595964526] [2025-01-09 03:52:37,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:37,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:37,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:37,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:37,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:52:38,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 03:52:38,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 03:52:38,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:38,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:38,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:38,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 03:52:38,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:38,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595964526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:38,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:38,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:52:38,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332537397] [2025-01-09 03:52:38,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:38,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:38,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:38,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:38,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:52:38,337 INFO L87 Difference]: Start difference. First operand 689 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-01-09 03:52:38,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:38,413 INFO L93 Difference]: Finished difference Result 1650 states and 2401 transitions. [2025-01-09 03:52:38,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:38,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 220 [2025-01-09 03:52:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:38,421 INFO L225 Difference]: With dead ends: 1650 [2025-01-09 03:52:38,421 INFO L226 Difference]: Without dead ends: 1329 [2025-01-09 03:52:38,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 220 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-01-09 03:52:38,424 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 722 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1689 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-01-09 03:52:38,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1689 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2025-01-09 03:52:38,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1327. [2025-01-09 03:52:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1015 states have (on average 1.4729064039408868) internal successors, (1495), 1032 states have internal predecessors, (1495), 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-01-09 03:52:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1946 transitions. [2025-01-09 03:52:38,483 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1946 transitions. Word has length 220 [2025-01-09 03:52:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:38,483 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1946 transitions. [2025-01-09 03:52:38,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-01-09 03:52:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1946 transitions. [2025-01-09 03:52:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 03:52:38,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:38,491 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, 1] [2025-01-09 03:52:38,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:38,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:38,692 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:38,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash -479893846, now seen corresponding path program 1 times [2025-01-09 03:52:38,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:38,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152270909] [2025-01-09 03:52:38,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:38,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:38,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 03:52:38,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 03:52:38,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:38,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 03:52:38,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:38,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152270909] [2025-01-09 03:52:38,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152270909] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:38,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77133107] [2025-01-09 03:52:38,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:38,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:38,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:38,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:38,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:52:39,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 03:52:39,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 03:52:39,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:39,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:39,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 1598 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 03:52:39,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 03:52:39,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:39,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77133107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:39,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:39,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-01-09 03:52:39,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541399983] [2025-01-09 03:52:39,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:39,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:39,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:39,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:39,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:52:39,329 INFO L87 Difference]: Start difference. First operand 1327 states and 1946 transitions. Second operand has 8 states, 6 states have (on average 21.666666666666668) internal successors, (130), 8 states have internal predecessors, (130), 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-01-09 03:52:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:39,451 INFO L93 Difference]: Finished difference Result 2575 states and 3802 transitions. [2025-01-09 03:52:39,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:52:39,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.666666666666668) internal successors, (130), 8 states have internal predecessors, (130), 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 213 [2025-01-09 03:52:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:39,458 INFO L225 Difference]: With dead ends: 2575 [2025-01-09 03:52:39,458 INFO L226 Difference]: Without dead ends: 1331 [2025-01-09 03:52:39,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 208 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-01-09 03:52:39,462 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 4 mSDsluCounter, 5035 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5877 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-01-09 03:52:39,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5877 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:39,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-01-09 03:52:39,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1331. [2025-01-09 03:52:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1017 states have (on average 1.471976401179941) internal successors, (1497), 1036 states have internal predecessors, (1497), 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-01-09 03:52:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1952 transitions. [2025-01-09 03:52:39,518 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1952 transitions. Word has length 213 [2025-01-09 03:52:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:39,518 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1952 transitions. [2025-01-09 03:52:39,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.666666666666668) internal successors, (130), 8 states have internal predecessors, (130), 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-01-09 03:52:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1952 transitions. [2025-01-09 03:52:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 03:52:39,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:39,523 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, 1] [2025-01-09 03:52:39,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:52:39,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 03:52:39,724 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:39,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash -176395809, now seen corresponding path program 1 times [2025-01-09 03:52:39,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:39,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461907525] [2025-01-09 03:52:39,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:39,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 03:52:39,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 03:52:39,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:39,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:52:39,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:39,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461907525] [2025-01-09 03:52:39,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461907525] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:39,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115665905] [2025-01-09 03:52:39,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:39,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:39,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:39,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:39,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:52:40,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 03:52:40,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 03:52:40,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:40,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:40,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:40,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:40,305 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 03:52:40,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:40,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115665905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:40,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:40,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 03:52:40,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151613793] [2025-01-09 03:52:40,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:40,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:40,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:40,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:40,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:52:40,307 INFO L87 Difference]: Start difference. First operand 1331 states and 1952 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-01-09 03:52:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:40,391 INFO L93 Difference]: Finished difference Result 3686 states and 5543 transitions. [2025-01-09 03:52:40,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:40,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 214 [2025-01-09 03:52:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:40,402 INFO L225 Difference]: With dead ends: 3686 [2025-01-09 03:52:40,403 INFO L226 Difference]: Without dead ends: 2486 [2025-01-09 03:52:40,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 214 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-01-09 03:52:40,407 INFO L435 NwaCegarLoop]: 1148 mSDtfsCounter, 690 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1980 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-01-09 03:52:40,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1980 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-01-09 03:52:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2484. [2025-01-09 03:52:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2484 states, 1905 states have (on average 1.48503937007874) internal successors, (2829), 1937 states have internal predecessors, (2829), 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-01-09 03:52:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3698 transitions. [2025-01-09 03:52:40,525 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3698 transitions. Word has length 214 [2025-01-09 03:52:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:40,526 INFO L471 AbstractCegarLoop]: Abstraction has 2484 states and 3698 transitions. [2025-01-09 03:52:40,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-01-09 03:52:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3698 transitions. [2025-01-09 03:52:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 03:52:40,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:40,533 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, 1] [2025-01-09 03:52:40,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:40,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:52:40,734 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:40,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:40,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1676876537, now seen corresponding path program 1 times [2025-01-09 03:52:40,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:40,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313789860] [2025-01-09 03:52:40,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:40,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:40,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 03:52:40,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 03:52:40,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:40,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:52:40,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:40,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313789860] [2025-01-09 03:52:40,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313789860] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:40,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565627274] [2025-01-09 03:52:40,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:40,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:40,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:40,894 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:40,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:52:41,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 03:52:41,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 03:52:41,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:41,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:41,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:52:41,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 03:52:41,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:41,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565627274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:41,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:41,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-01-09 03:52:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011816407] [2025-01-09 03:52:41,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:41,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:52:41,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:41,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:52:41,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:52:41,266 INFO L87 Difference]: Start difference. First operand 2484 states and 3698 transitions. Second operand has 6 states, 5 states have (on average 26.4) internal successors, (132), 6 states have internal predecessors, (132), 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-01-09 03:52:41,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:41,428 INFO L93 Difference]: Finished difference Result 4884 states and 7308 transitions. [2025-01-09 03:52:41,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:52:41,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.4) internal successors, (132), 6 states have internal predecessors, (132), 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 214 [2025-01-09 03:52:41,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:41,446 INFO L225 Difference]: With dead ends: 4884 [2025-01-09 03:52:41,446 INFO L226 Difference]: Without dead ends: 2492 [2025-01-09 03:52:41,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 211 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-01-09 03:52:41,453 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 2 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4193 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-01-09 03:52:41,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4193 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:41,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-01-09 03:52:41,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2488. [2025-01-09 03:52:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 1907 states have (on average 1.4845306764551651) internal successors, (2831), 1941 states have internal predecessors, (2831), 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-01-09 03:52:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3710 transitions. [2025-01-09 03:52:41,547 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3710 transitions. Word has length 214 [2025-01-09 03:52:41,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:41,548 INFO L471 AbstractCegarLoop]: Abstraction has 2488 states and 3710 transitions. [2025-01-09 03:52:41,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.4) internal successors, (132), 6 states have internal predecessors, (132), 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-01-09 03:52:41,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3710 transitions. [2025-01-09 03:52:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 03:52:41,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:41,556 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] [2025-01-09 03:52:41,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:41,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:52:41,757 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:41,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:41,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1684266918, now seen corresponding path program 1 times [2025-01-09 03:52:41,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:41,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643335805] [2025-01-09 03:52:41,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:41,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:41,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 03:52:41,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 03:52:41,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:41,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 03:52:41,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:41,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643335805] [2025-01-09 03:52:41,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643335805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:41,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:41,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:41,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096877106] [2025-01-09 03:52:41,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:41,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:41,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:41,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:41,922 INFO L87 Difference]: Start difference. First operand 2488 states and 3710 transitions. Second operand has 8 states, 6 states have (on average 21.333333333333332) internal successors, (128), 8 states have internal predecessors, (128), 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-01-09 03:52:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:42,038 INFO L93 Difference]: Finished difference Result 4856 states and 7274 transitions. [2025-01-09 03:52:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:52:42,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.333333333333332) internal successors, (128), 8 states have internal predecessors, (128), 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 215 [2025-01-09 03:52:42,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:42,049 INFO L225 Difference]: With dead ends: 4856 [2025-01-09 03:52:42,049 INFO L226 Difference]: Without dead ends: 2488 [2025-01-09 03:52:42,055 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-01-09 03:52:42,056 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 4 mSDsluCounter, 5041 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5884 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-01-09 03:52:42,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5884 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2025-01-09 03:52:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2488. [2025-01-09 03:52:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 1907 states have (on average 1.4845306764551651) internal successors, (2831), 1941 states have internal predecessors, (2831), 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-01-09 03:52:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3708 transitions. [2025-01-09 03:52:42,141 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3708 transitions. Word has length 215 [2025-01-09 03:52:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:42,142 INFO L471 AbstractCegarLoop]: Abstraction has 2488 states and 3708 transitions. [2025-01-09 03:52:42,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.333333333333332) internal successors, (128), 8 states have internal predecessors, (128), 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-01-09 03:52:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3708 transitions. [2025-01-09 03:52:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 03:52:42,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:42,149 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] [2025-01-09 03:52:42,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:52:42,150 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:42,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:42,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1032714599, now seen corresponding path program 2 times [2025-01-09 03:52:42,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:42,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080626571] [2025-01-09 03:52:42,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:52:42,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:42,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 216 statements into 2 equivalence classes. [2025-01-09 03:52:42,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 216 statements. [2025-01-09 03:52:42,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:52:42,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:52:42,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:42,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080626571] [2025-01-09 03:52:42,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080626571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:42,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:42,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:52:42,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222424252] [2025-01-09 03:52:42,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:42,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:52:42,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:42,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:52:42,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:52:42,283 INFO L87 Difference]: Start difference. First operand 2488 states and 3708 transitions. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 5 states have internal predecessors, (125), 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-01-09 03:52:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:42,402 INFO L93 Difference]: Finished difference Result 3722 states and 5519 transitions. [2025-01-09 03:52:42,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:52:42,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 5 states have internal predecessors, (125), 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 216 [2025-01-09 03:52:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:42,417 INFO L225 Difference]: With dead ends: 3722 [2025-01-09 03:52:42,417 INFO L226 Difference]: Without dead ends: 2504 [2025-01-09 03:52:42,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:52:42,422 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 4241 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5091 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:42,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5091 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2025-01-09 03:52:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2504. [2025-01-09 03:52:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 1919 states have (on average 1.481500781657113) internal successors, (2843), 1953 states have internal predecessors, (2843), 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-01-09 03:52:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3728 transitions. [2025-01-09 03:52:42,530 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3728 transitions. Word has length 216 [2025-01-09 03:52:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:42,530 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3728 transitions. [2025-01-09 03:52:42,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 5 states have internal predecessors, (125), 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-01-09 03:52:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3728 transitions. [2025-01-09 03:52:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 03:52:42,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:42,546 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] [2025-01-09 03:52:42,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:52:42,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:42,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash -218352791, now seen corresponding path program 1 times [2025-01-09 03:52:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:42,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943130244] [2025-01-09 03:52:42,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:42,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 03:52:42,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 03:52:42,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:42,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 03:52:42,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:42,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943130244] [2025-01-09 03:52:42,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943130244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:42,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:42,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:42,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800746644] [2025-01-09 03:52:42,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:42,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:42,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:42,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:42,780 INFO L87 Difference]: Start difference. First operand 2504 states and 3728 transitions. Second operand has 8 states, 6 states have (on average 22.0) internal successors, (132), 8 states have internal predecessors, (132), 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-01-09 03:52:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:42,955 INFO L93 Difference]: Finished difference Result 4892 states and 7320 transitions. [2025-01-09 03:52:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:52:42,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 22.0) internal successors, (132), 8 states have internal predecessors, (132), 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 219 [2025-01-09 03:52:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:42,969 INFO L225 Difference]: With dead ends: 4892 [2025-01-09 03:52:42,970 INFO L226 Difference]: Without dead ends: 2508 [2025-01-09 03:52:42,977 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-01-09 03:52:42,978 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 3 mSDsluCounter, 5046 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5890 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-01-09 03:52:42,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5890 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2025-01-09 03:52:43,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2508. [2025-01-09 03:52:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2508 states, 1921 states have (on average 1.4809994794377928) internal successors, (2845), 1957 states have internal predecessors, (2845), 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-01-09 03:52:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 3734 transitions. [2025-01-09 03:52:43,064 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 3734 transitions. Word has length 219 [2025-01-09 03:52:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:43,065 INFO L471 AbstractCegarLoop]: Abstraction has 2508 states and 3734 transitions. [2025-01-09 03:52:43,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 22.0) internal successors, (132), 8 states have internal predecessors, (132), 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-01-09 03:52:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3734 transitions. [2025-01-09 03:52:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 03:52:43,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:43,072 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] [2025-01-09 03:52:43,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:52:43,072 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:43,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:43,073 INFO L85 PathProgramCache]: Analyzing trace with hash 71304273, now seen corresponding path program 1 times [2025-01-09 03:52:43,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:43,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295904176] [2025-01-09 03:52:43,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:43,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:43,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 03:52:43,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 03:52:43,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:43,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:52:43,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295904176] [2025-01-09 03:52:43,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295904176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:43,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:43,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:52:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471791405] [2025-01-09 03:52:43,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:43,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:52:43,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:43,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:52:43,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:52:43,237 INFO L87 Difference]: Start difference. First operand 2508 states and 3734 transitions. Second operand has 9 states, 7 states have (on average 19.428571428571427) internal successors, (136), 8 states have internal predecessors, (136), 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-01-09 03:52:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:43,437 INFO L93 Difference]: Finished difference Result 4890 states and 7316 transitions. [2025-01-09 03:52:43,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:52:43,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 19.428571428571427) internal successors, (136), 8 states have internal predecessors, (136), 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 220 [2025-01-09 03:52:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:43,457 INFO L225 Difference]: With dead ends: 4890 [2025-01-09 03:52:43,457 INFO L226 Difference]: Without dead ends: 2512 [2025-01-09 03:52:43,465 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-01-09 03:52:43,466 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 7 mSDsluCounter, 5822 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6658 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-01-09 03:52:43,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6658 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2025-01-09 03:52:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2508. [2025-01-09 03:52:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2508 states, 1921 states have (on average 1.4809994794377928) internal successors, (2845), 1957 states have internal predecessors, (2845), 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-01-09 03:52:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 3732 transitions. [2025-01-09 03:52:43,563 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 3732 transitions. Word has length 220 [2025-01-09 03:52:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:43,563 INFO L471 AbstractCegarLoop]: Abstraction has 2508 states and 3732 transitions. [2025-01-09 03:52:43,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 19.428571428571427) internal successors, (136), 8 states have internal predecessors, (136), 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-01-09 03:52:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3732 transitions. [2025-01-09 03:52:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 03:52:43,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:43,571 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] [2025-01-09 03:52:43,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:52:43,571 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:43,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash 120842812, now seen corresponding path program 2 times [2025-01-09 03:52:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:43,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036305595] [2025-01-09 03:52:43,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:52:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:43,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 221 statements into 2 equivalence classes. [2025-01-09 03:52:43,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 221 statements. [2025-01-09 03:52:43,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:52:43,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-09 03:52:43,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:43,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036305595] [2025-01-09 03:52:43,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036305595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:43,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:43,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:52:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571370331] [2025-01-09 03:52:43,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:43,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:52:43,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:43,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:52:43,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:52:43,638 INFO L87 Difference]: Start difference. First operand 2508 states and 3732 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-01-09 03:52:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:44,222 INFO L93 Difference]: Finished difference Result 6084 states and 9196 transitions. [2025-01-09 03:52:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:52:44,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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 221 [2025-01-09 03:52:44,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:44,242 INFO L225 Difference]: With dead ends: 6084 [2025-01-09 03:52:44,242 INFO L226 Difference]: Without dead ends: 3612 [2025-01-09 03:52:44,250 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-01-09 03:52:44,251 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1477 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 2788 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-01-09 03:52:44,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 2788 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:52:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3612 states. [2025-01-09 03:52:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3612 to 3610. [2025-01-09 03:52:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3610 states, 2787 states have (on average 1.480086114101184) internal successors, (4125), 2826 states have internal predecessors, (4125), 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-01-09 03:52:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 5340 transitions. [2025-01-09 03:52:44,368 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 5340 transitions. Word has length 221 [2025-01-09 03:52:44,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:44,369 INFO L471 AbstractCegarLoop]: Abstraction has 3610 states and 5340 transitions. [2025-01-09 03:52:44,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-01-09 03:52:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 5340 transitions. [2025-01-09 03:52:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 03:52:44,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:44,377 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, 1] [2025-01-09 03:52:44,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:52:44,378 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:44,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2051609504, now seen corresponding path program 1 times [2025-01-09 03:52:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:44,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083040453] [2025-01-09 03:52:44,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:44,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:44,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 03:52:44,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 03:52:44,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:44,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:52:44,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083040453] [2025-01-09 03:52:44,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083040453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:44,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:44,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:52:44,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539154948] [2025-01-09 03:52:44,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:44,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:52:44,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:44,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:52:44,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:52:44,585 INFO L87 Difference]: Start difference. First operand 3610 states and 5340 transitions. Second operand has 9 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 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-01-09 03:52:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:44,827 INFO L93 Difference]: Finished difference Result 7052 states and 10498 transitions. [2025-01-09 03:52:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:52:44,828 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 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 225 [2025-01-09 03:52:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:44,852 INFO L225 Difference]: With dead ends: 7052 [2025-01-09 03:52:44,852 INFO L226 Difference]: Without dead ends: 3622 [2025-01-09 03:52:44,862 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-01-09 03:52:44,863 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 4 mSDsluCounter, 5836 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6674 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-01-09 03:52:44,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6674 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-01-09 03:52:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3616. [2025-01-09 03:52:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3616 states, 2790 states have (on average 1.4795698924731182) internal successors, (4128), 2832 states have internal predecessors, (4128), 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-01-09 03:52:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 5358 transitions. [2025-01-09 03:52:45,040 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 5358 transitions. Word has length 225 [2025-01-09 03:52:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:45,040 INFO L471 AbstractCegarLoop]: Abstraction has 3616 states and 5358 transitions. [2025-01-09 03:52:45,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 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-01-09 03:52:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 5358 transitions. [2025-01-09 03:52:45,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 03:52:45,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:45,050 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] [2025-01-09 03:52:45,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:52:45,051 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:45,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:45,051 INFO L85 PathProgramCache]: Analyzing trace with hash 761657370, now seen corresponding path program 1 times [2025-01-09 03:52:45,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:45,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679687729] [2025-01-09 03:52:45,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:45,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:45,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 03:52:45,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 03:52:45,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:45,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:52:45,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679687729] [2025-01-09 03:52:45,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679687729] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523771907] [2025-01-09 03:52:45,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:45,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:45,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:45,182 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:45,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:52:45,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 03:52:45,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 03:52:45,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:45,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:45,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:45,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:52:45,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:52:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:52:45,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523771907] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:52:45,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:52:45,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:52:45,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113300774] [2025-01-09 03:52:45,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:52:45,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:52:45,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:45,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:52:45,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:52:45,664 INFO L87 Difference]: Start difference. First operand 3616 states and 5358 transitions. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 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-01-09 03:52:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:45,945 INFO L93 Difference]: Finished difference Result 8057 states and 12186 transitions. [2025-01-09 03:52:45,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:52:45,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 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 226 [2025-01-09 03:52:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:45,968 INFO L225 Difference]: With dead ends: 8057 [2025-01-09 03:52:45,968 INFO L226 Difference]: Without dead ends: 6295 [2025-01-09 03:52:45,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 449 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-01-09 03:52:45,975 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 933 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:45,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 2241 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:45,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6295 states. [2025-01-09 03:52:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6295 to 6157. [2025-01-09 03:52:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6157 states, 4950 states have (on average 1.5212121212121212) internal successors, (7530), 4992 states have internal predecessors, (7530), 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-01-09 03:52:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6157 states to 6157 states and 9552 transitions. [2025-01-09 03:52:46,154 INFO L78 Accepts]: Start accepts. Automaton has 6157 states and 9552 transitions. Word has length 226 [2025-01-09 03:52:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:46,155 INFO L471 AbstractCegarLoop]: Abstraction has 6157 states and 9552 transitions. [2025-01-09 03:52:46,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 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-01-09 03:52:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 6157 states and 9552 transitions. [2025-01-09 03:52:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-09 03:52:46,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:46,176 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-01-09 03:52:46,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 03:52:46,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:46,380 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:46,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:46,381 INFO L85 PathProgramCache]: Analyzing trace with hash 961756109, now seen corresponding path program 1 times [2025-01-09 03:52:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:46,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735607523] [2025-01-09 03:52:46,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:46,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:46,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 03:52:46,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 03:52:46,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:46,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:52:46,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:46,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735607523] [2025-01-09 03:52:46,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735607523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:46,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:46,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:46,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585465419] [2025-01-09 03:52:46,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:46,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:46,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:46,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:46,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:46,445 INFO L87 Difference]: Start difference. First operand 6157 states and 9552 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-01-09 03:52:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:46,675 INFO L93 Difference]: Finished difference Result 14276 states and 22432 transitions. [2025-01-09 03:52:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:46,676 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-01-09 03:52:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:46,705 INFO L225 Difference]: With dead ends: 14276 [2025-01-09 03:52:46,706 INFO L226 Difference]: Without dead ends: 9058 [2025-01-09 03:52:46,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:46,721 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 163 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:46,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1716 Invalid, 4 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9058 states. [2025-01-09 03:52:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9058 to 9010. [2025-01-09 03:52:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9010 states, 7338 states have (on average 1.53556827473426) internal successors, (11268), 7380 states have internal predecessors, (11268), 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-01-09 03:52:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9010 states to 9010 states and 14250 transitions. [2025-01-09 03:52:47,088 INFO L78 Accepts]: Start accepts. Automaton has 9010 states and 14250 transitions. Word has length 231 [2025-01-09 03:52:47,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:47,088 INFO L471 AbstractCegarLoop]: Abstraction has 9010 states and 14250 transitions. [2025-01-09 03:52:47,088 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-01-09 03:52:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 9010 states and 14250 transitions. [2025-01-09 03:52:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-09 03:52:47,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:47,115 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-01-09 03:52:47,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:52:47,115 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:47,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1852736146, now seen corresponding path program 1 times [2025-01-09 03:52:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:47,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144921821] [2025-01-09 03:52:47,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:47,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 03:52:47,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 03:52:47,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:47,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:52:47,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:47,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144921821] [2025-01-09 03:52:47,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144921821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:47,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:47,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:47,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641862246] [2025-01-09 03:52:47,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:47,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:47,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:47,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:47,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:47,183 INFO L87 Difference]: Start difference. First operand 9010 states and 14250 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-01-09 03:52:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:47,458 INFO L93 Difference]: Finished difference Result 21488 states and 34297 transitions. [2025-01-09 03:52:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:47,459 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-01-09 03:52:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:47,498 INFO L225 Difference]: With dead ends: 21488 [2025-01-09 03:52:47,498 INFO L226 Difference]: Without dead ends: 13210 [2025-01-09 03:52:47,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:47,510 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 161 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:47,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1698 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:47,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13210 states. [2025-01-09 03:52:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13210 to 13162. [2025-01-09 03:52:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13162 states, 10863 states have (on average 1.547362607014637) internal successors, (16809), 10905 states have internal predecessors, (16809), 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-01-09 03:52:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13162 states to 13162 states and 21045 transitions. [2025-01-09 03:52:48,070 INFO L78 Accepts]: Start accepts. Automaton has 13162 states and 21045 transitions. Word has length 232 [2025-01-09 03:52:48,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:48,071 INFO L471 AbstractCegarLoop]: Abstraction has 13162 states and 21045 transitions. [2025-01-09 03:52:48,071 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-01-09 03:52:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 13162 states and 21045 transitions. [2025-01-09 03:52:48,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-01-09 03:52:48,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:48,107 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-01-09 03:52:48,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:52:48,107 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:48,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1541919974, now seen corresponding path program 1 times [2025-01-09 03:52:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:48,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317145029] [2025-01-09 03:52:48,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:48,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-09 03:52:48,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-09 03:52:48,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:48,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:52:48,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:48,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317145029] [2025-01-09 03:52:48,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317145029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:48,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:48,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:48,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743550199] [2025-01-09 03:52:48,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:48,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:48,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:48,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:48,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:48,187 INFO L87 Difference]: Start difference. First operand 13162 states and 21045 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-01-09 03:52:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:48,699 INFO L93 Difference]: Finished difference Result 31202 states and 50317 transitions. [2025-01-09 03:52:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:48,700 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-01-09 03:52:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:48,783 INFO L225 Difference]: With dead ends: 31202 [2025-01-09 03:52:48,783 INFO L226 Difference]: Without dead ends: 19615 [2025-01-09 03:52:48,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:48,813 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 159 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:48,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1693 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19615 states. [2025-01-09 03:52:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19615 to 19567. [2025-01-09 03:52:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19567 states, 16410 states have (on average 1.5577696526508227) internal successors, (25563), 16452 states have internal predecessors, (25563), 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-01-09 03:52:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19567 states to 19567 states and 31563 transitions. [2025-01-09 03:52:49,588 INFO L78 Accepts]: Start accepts. Automaton has 19567 states and 31563 transitions. Word has length 233 [2025-01-09 03:52:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:49,589 INFO L471 AbstractCegarLoop]: Abstraction has 19567 states and 31563 transitions. [2025-01-09 03:52:49,589 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-01-09 03:52:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 19567 states and 31563 transitions. [2025-01-09 03:52:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 03:52:49,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:49,647 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-01-09 03:52:49,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:52:49,647 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:49,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:49,648 INFO L85 PathProgramCache]: Analyzing trace with hash 22532522, now seen corresponding path program 1 times [2025-01-09 03:52:49,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:49,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172041843] [2025-01-09 03:52:49,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:49,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:49,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 03:52:49,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 03:52:49,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:49,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:52:49,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:49,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172041843] [2025-01-09 03:52:49,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172041843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:49,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:49,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:49,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031754220] [2025-01-09 03:52:49,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:49,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:49,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:49,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:49,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:49,716 INFO L87 Difference]: Start difference. First operand 19567 states and 31563 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-01-09 03:52:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:50,356 INFO L93 Difference]: Finished difference Result 46928 states and 76321 transitions. [2025-01-09 03:52:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:50,357 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-01-09 03:52:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:50,489 INFO L225 Difference]: With dead ends: 46928 [2025-01-09 03:52:50,489 INFO L226 Difference]: Without dead ends: 30175 [2025-01-09 03:52:50,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:50,528 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 157 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:50,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1693 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30175 states. [2025-01-09 03:52:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30175 to 30127. [2025-01-09 03:52:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30127 states, 25647 states have (on average 1.567317814949117) internal successors, (40197), 25689 states have internal predecessors, (40197), 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-01-09 03:52:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30127 states to 30127 states and 48921 transitions. [2025-01-09 03:52:51,937 INFO L78 Accepts]: Start accepts. Automaton has 30127 states and 48921 transitions. Word has length 234 [2025-01-09 03:52:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:51,937 INFO L471 AbstractCegarLoop]: Abstraction has 30127 states and 48921 transitions. [2025-01-09 03:52:51,937 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-01-09 03:52:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 30127 states and 48921 transitions. [2025-01-09 03:52:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-09 03:52:52,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:52,012 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-01-09 03:52:52,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:52:52,012 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:52,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash 589320337, now seen corresponding path program 1 times [2025-01-09 03:52:52,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:52,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002700117] [2025-01-09 03:52:52,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:52,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:52,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-09 03:52:52,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-09 03:52:52,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:52,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:52:52,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:52,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002700117] [2025-01-09 03:52:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002700117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:52,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:52,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792176168] [2025-01-09 03:52:52,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:52,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:52,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:52,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:52,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:52,074 INFO L87 Difference]: Start difference. First operand 30127 states and 48921 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-01-09 03:52:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:53,154 INFO L93 Difference]: Finished difference Result 73895 states and 120703 transitions. [2025-01-09 03:52:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:53,155 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-01-09 03:52:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:53,361 INFO L225 Difference]: With dead ends: 73895 [2025-01-09 03:52:53,361 INFO L226 Difference]: Without dead ends: 48337 [2025-01-09 03:52:53,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:53,450 INFO L435 NwaCegarLoop]: 863 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, 1701 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:53,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1701 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48337 states. [2025-01-09 03:52:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48337 to 48289. [2025-01-09 03:52:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48289 states, 41076 states have (on average 1.565293602103418) internal successors, (64296), 41118 states have internal predecessors, (64296), 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-01-09 03:52:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48289 states to 48289 states and 78618 transitions. [2025-01-09 03:52:55,219 INFO L78 Accepts]: Start accepts. Automaton has 48289 states and 78618 transitions. Word has length 235 [2025-01-09 03:52:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:55,220 INFO L471 AbstractCegarLoop]: Abstraction has 48289 states and 78618 transitions. [2025-01-09 03:52:55,220 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-01-09 03:52:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 48289 states and 78618 transitions. [2025-01-09 03:52:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-09 03:52:55,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:55,664 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-01-09 03:52:55,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:52:55,664 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:55,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1547713023, now seen corresponding path program 1 times [2025-01-09 03:52:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:55,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963744420] [2025-01-09 03:52:55,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:55,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:55,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 03:52:55,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 03:52:55,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:55,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:52:55,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:55,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963744420] [2025-01-09 03:52:55,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963744420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:55,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:55,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:55,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724315543] [2025-01-09 03:52:55,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:55,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:55,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:55,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:55,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:55,728 INFO L87 Difference]: Start difference. First operand 48289 states and 78618 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-01-09 03:52:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:58,037 INFO L93 Difference]: Finished difference Result 123521 states and 202687 transitions. [2025-01-09 03:52:58,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:58,037 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-01-09 03:52:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:58,434 INFO L225 Difference]: With dead ends: 123521 [2025-01-09 03:52:58,434 INFO L226 Difference]: Without dead ends: 81850 [2025-01-09 03:52:58,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:58,508 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 153 mSDsluCounter, 844 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-01-09 03:52:58,508 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-01-09 03:52:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81850 states. [2025-01-09 03:53:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81850 to 81802. [2025-01-09 03:53:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81802 states, 69915 states have (on average 1.5716369877708647) internal successors, (109881), 69957 states have internal predecessors, (109881), 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-01-09 03:53:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81802 states to 81802 states and 133785 transitions. [2025-01-09 03:53:01,015 INFO L78 Accepts]: Start accepts. Automaton has 81802 states and 133785 transitions. Word has length 236 [2025-01-09 03:53:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:01,015 INFO L471 AbstractCegarLoop]: Abstraction has 81802 states and 133785 transitions. [2025-01-09 03:53:01,016 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-01-09 03:53:01,016 INFO L276 IsEmpty]: Start isEmpty. Operand 81802 states and 133785 transitions. [2025-01-09 03:53:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-09 03:53:01,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:01,293 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-01-09 03:53:01,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:53:01,293 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:01,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1348050102, now seen corresponding path program 1 times [2025-01-09 03:53:01,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:01,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451812916] [2025-01-09 03:53:01,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:01,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:01,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 03:53:01,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 03:53:01,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:01,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:53:01,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:01,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451812916] [2025-01-09 03:53:01,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451812916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:01,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:01,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:01,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398324793] [2025-01-09 03:53:01,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:01,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:01,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:01,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:01,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:01,357 INFO L87 Difference]: Start difference. First operand 81802 states and 133785 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) [2025-01-09 03:53:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:04,272 INFO L93 Difference]: Finished difference Result 201689 states and 328051 transitions. [2025-01-09 03:53:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:04,273 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 237 [2025-01-09 03:53:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:04,716 INFO L225 Difference]: With dead ends: 201689 [2025-01-09 03:53:04,716 INFO L226 Difference]: Without dead ends: 131221 [2025-01-09 03:53:04,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:04,848 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 151 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:04,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1675 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131221 states. [2025-01-09 03:53:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131221 to 131173. [2025-01-09 03:53:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131173 states, 112329 states have (on average 1.5429586304516199) internal successors, (173319), 112371 states have internal predecessors, (173319), 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-01-09 03:53:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131173 states to 131173 states and 211569 transitions. [2025-01-09 03:53:09,373 INFO L78 Accepts]: Start accepts. Automaton has 131173 states and 211569 transitions. Word has length 237 [2025-01-09 03:53:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:09,374 INFO L471 AbstractCegarLoop]: Abstraction has 131173 states and 211569 transitions. [2025-01-09 03:53:09,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-01-09 03:53:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 131173 states and 211569 transitions. [2025-01-09 03:53:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-09 03:53:09,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:09,656 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, 1] [2025-01-09 03:53:09,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 03:53:09,657 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:09,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash 527332343, now seen corresponding path program 1 times [2025-01-09 03:53:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:09,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442706271] [2025-01-09 03:53:09,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:09,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 03:53:09,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 03:53:09,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:09,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-09 03:53:09,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:09,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442706271] [2025-01-09 03:53:09,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442706271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:09,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:09,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959129374] [2025-01-09 03:53:09,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:09,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:09,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:09,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:09,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:09,713 INFO L87 Difference]: Start difference. First operand 131173 states and 211569 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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)