./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_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_spec0_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 1b548755c8e9cfcfe9ed8b47fb1ac823ac6821056e7770bffa975fdbf413b243 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:49:35,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:49:36,061 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:49:36,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:49:36,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:49:36,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:49:36,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:49:36,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:49:36,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:49:36,108 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:49:36,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:49:36,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:49:36,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:49:36,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:49:36,109 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:49:36,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:49:36,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:49:36,110 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:49:36,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:49:36,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:49:36,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:49:36,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:49:36,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:49:36,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:49:36,111 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:49:36,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:49:36,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:49:36,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:49:36,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:49:36,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:49:36,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:49:36,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:49:36,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:49:36,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:49:36,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:49:36,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:49:36,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:49:36,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:49:36,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:49:36,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:49:36,113 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:49:36,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:49:36,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:49:36,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:49:36,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:49:36,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:49:36,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:49:36,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:49:36,114 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 -> 1b548755c8e9cfcfe9ed8b47fb1ac823ac6821056e7770bffa975fdbf413b243 [2025-01-09 03:49:36,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:49:36,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:49:36,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:49:36,413 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:49:36,413 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:49:36,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c [2025-01-09 03:49:37,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16b95835f/99b9df9f56584f54926fd039498c42ee/FLAG29523a21b [2025-01-09 03:49:38,237 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:49:38,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c [2025-01-09 03:49:38,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16b95835f/99b9df9f56584f54926fd039498c42ee/FLAG29523a21b [2025-01-09 03:49:38,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16b95835f/99b9df9f56584f54926fd039498c42ee [2025-01-09 03:49:38,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:49:38,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:49:38,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:49:38,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:49:38,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:49:38,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:38" (1/1) ... [2025-01-09 03:49:38,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474ef4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:38, skipping insertion in model container [2025-01-09 03:49:38,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:38" (1/1) ... [2025-01-09 03:49:38,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:49:38,747 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_spec0_productSimulator.cil.c[14867,14880] [2025-01-09 03:49:38,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:49:38,985 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:49:38,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-01-09 03:49:38,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [168] [2025-01-09 03:49:38,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [751] [2025-01-09 03:49:38,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [768] [2025-01-09 03:49:38,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [777] [2025-01-09 03:49:38,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1848] [2025-01-09 03:49:38,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2247] [2025-01-09 03:49:38,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2608] [2025-01-09 03:49:38,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [2874] [2025-01-09 03:49:38,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2893] [2025-01-09 03:49:38,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3097] [2025-01-09 03:49:39,036 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_spec0_productSimulator.cil.c[14867,14880] [2025-01-09 03:49:39,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:49:39,166 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:49:39,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39 WrapperNode [2025-01-09 03:49:39,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:49:39,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:49:39,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:49:39,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:49:39,174 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:49:39" (1/1) ... [2025-01-09 03:49:39,202 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:49:39" (1/1) ... [2025-01-09 03:49:39,264 INFO L138 Inliner]: procedures = 151, calls = 262, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1305 [2025-01-09 03:49:39,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:49:39,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:49:39,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:49:39,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:49:39,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39" (1/1) ... [2025-01-09 03:49:39,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39" (1/1) ... [2025-01-09 03:49:39,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39" (1/1) ... [2025-01-09 03:49:39,334 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:49:39,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39" (1/1) ... [2025-01-09 03:49:39,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39" (1/1) ... [2025-01-09 03:49:39,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39" (1/1) ... [2025-01-09 03:49:39,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39" (1/1) ... [2025-01-09 03:49:39,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39" (1/1) ... [2025-01-09 03:49:39,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39" (1/1) ... [2025-01-09 03:49:39,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39" (1/1) ... [2025-01-09 03:49:39,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:49:39,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:49:39,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:49:39,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:49:39,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39" (1/1) ... [2025-01-09 03:49:39,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:49:39,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:39,449 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:49:39,453 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:49:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:49:39,471 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:49:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-01-09 03:49:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-01-09 03:49:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-01-09 03:49:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-01-09 03:49:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:49:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:49:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:49:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:49:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:49:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:49:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:49:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:49:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-01-09 03:49:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-01-09 03:49:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:49:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:49:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-01-09 03:49:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-01-09 03:49:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:49:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:49:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:49:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:49:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:49:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:49:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-01-09 03:49:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-01-09 03:49:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-01-09 03:49:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-01-09 03:49:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:49:39,475 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:49:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:49:39,475 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:49:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:49:39,475 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:49:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-01-09 03:49:39,475 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-01-09 03:49:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:49:39,476 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:49:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:49:39,476 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:49:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:49:39,476 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:49:39,477 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-01-09 03:49:39,477 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-01-09 03:49:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:49:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:49:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:49:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:49:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:49:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-01-09 03:49:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-01-09 03:49:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-01-09 03:49:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-01-09 03:49:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-01-09 03:49:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-01-09 03:49:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:49:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:49:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:49:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:49:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:49:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:49:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:49:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:49:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:49:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:49:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:49:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:49:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:49:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:49:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-01-09 03:49:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-01-09 03:49:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-01-09 03:49:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-01-09 03:49:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:49:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:49:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:49:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:49:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:49:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:49:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:49:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:49:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:49:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:49:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-01-09 03:49:39,480 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-01-09 03:49:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-01-09 03:49:39,480 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-01-09 03:49:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:49:39,480 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:49:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:49:39,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:49:39,730 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:49:39,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:49:41,014 INFO L? ?]: Removed 623 outVars from TransFormulas that were not future-live. [2025-01-09 03:49:41,014 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:49:41,045 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:49:41,048 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:49:41,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:41 BoogieIcfgContainer [2025-01-09 03:49:41,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:49:41,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:49:41,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:49:41,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:49:41,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:49:38" (1/3) ... [2025-01-09 03:49:41,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67acde8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:41, skipping insertion in model container [2025-01-09 03:49:41,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:39" (2/3) ... [2025-01-09 03:49:41,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67acde8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:41, skipping insertion in model container [2025-01-09 03:49:41,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:41" (3/3) ... [2025-01-09 03:49:41,063 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_productSimulator.cil.c [2025-01-09 03:49:41,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:49:41,082 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_productSimulator.cil.c that has 44 procedures, 599 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:49:41,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:49:41,172 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;@50a421aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:49:41,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:49:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 03:49:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 03:49:41,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:41,200 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:41,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:41,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash 325572849, now seen corresponding path program 1 times [2025-01-09 03:49:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:41,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095069487] [2025-01-09 03:49:41,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:41,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 03:49:41,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 03:49:41,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:41,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-09 03:49:41,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:41,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095069487] [2025-01-09 03:49:41,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095069487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:41,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:41,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:49:41,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681073687] [2025-01-09 03:49:41,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:41,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:49:41,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:42,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:49:42,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:49:42,016 INFO L87 Difference]: Start difference. First operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:49:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:42,196 INFO L93 Difference]: Finished difference Result 1161 states and 1742 transitions. [2025-01-09 03:49:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:49:42,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 164 [2025-01-09 03:49:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:42,220 INFO L225 Difference]: With dead ends: 1161 [2025-01-09 03:49:42,223 INFO L226 Difference]: Without dead ends: 592 [2025-01-09 03:49:42,232 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:49:42,235 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 0 mSDsluCounter, 2645 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3531 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:49:42,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3531 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-09 03:49:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-01-09 03:49:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 439 states have (on average 1.4965831435079726) internal successors, (657), 458 states have internal predecessors, (657), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 03:49:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 874 transitions. [2025-01-09 03:49:42,330 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 874 transitions. Word has length 164 [2025-01-09 03:49:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:42,332 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 874 transitions. [2025-01-09 03:49:42,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:49:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 874 transitions. [2025-01-09 03:49:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 03:49:42,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:42,341 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:42,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:49:42,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:42,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash -164724782, now seen corresponding path program 1 times [2025-01-09 03:49:42,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:42,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071240558] [2025-01-09 03:49:42,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:42,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 03:49:42,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 03:49:42,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:42,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:42,870 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:49:42,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:42,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071240558] [2025-01-09 03:49:42,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071240558] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:42,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951484509] [2025-01-09 03:49:42,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:42,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:42,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:42,875 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:49:42,877 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:49:43,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 03:49:43,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 03:49:43,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:43,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:43,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:49:43,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 03:49:43,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:43,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951484509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:43,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:43,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 03:49:43,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33623685] [2025-01-09 03:49:43,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:43,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:43,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:43,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:43,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:43,448 INFO L87 Difference]: Start difference. First operand 592 states and 874 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 03:49:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:43,502 INFO L93 Difference]: Finished difference Result 919 states and 1331 transitions. [2025-01-09 03:49:43,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:43,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 182 [2025-01-09 03:49:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:43,512 INFO L225 Difference]: With dead ends: 919 [2025-01-09 03:49:43,513 INFO L226 Difference]: Without dead ends: 594 [2025-01-09 03:49:43,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:43,516 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 1 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1742 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:49:43,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1742 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:43,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-01-09 03:49:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 593. [2025-01-09 03:49:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 440 states have (on average 1.4954545454545454) internal successors, (658), 459 states have internal predecessors, (658), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 03:49:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 875 transitions. [2025-01-09 03:49:43,556 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 875 transitions. Word has length 182 [2025-01-09 03:49:43,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:43,556 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 875 transitions. [2025-01-09 03:49:43,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 03:49:43,557 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 875 transitions. [2025-01-09 03:49:43,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 03:49:43,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:43,562 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:43,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:49:43,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:43,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:43,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:43,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1672606219, now seen corresponding path program 1 times [2025-01-09 03:49:43,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:43,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720370977] [2025-01-09 03:49:43,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:43,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:43,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 03:49:43,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 03:49:43,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:43,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-09 03:49:44,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:44,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720370977] [2025-01-09 03:49:44,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720370977] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:44,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468110928] [2025-01-09 03:49:44,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:44,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:44,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:44,127 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:49:44,131 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:49:44,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 03:49:44,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 03:49:44,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:44,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:44,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:49:44,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 03:49:44,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:44,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468110928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:44,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:44,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-01-09 03:49:44,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879822280] [2025-01-09 03:49:44,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:44,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:49:44,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:44,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:49:44,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:49:44,658 INFO L87 Difference]: Start difference. First operand 593 states and 875 transitions. Second operand has 7 states, 6 states have (on average 17.0) internal successors, (102), 7 states have internal predecessors, (102), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:49:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:44,804 INFO L93 Difference]: Finished difference Result 1133 states and 1679 transitions. [2025-01-09 03:49:44,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:49:44,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 7 states have internal predecessors, (102), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 175 [2025-01-09 03:49:44,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:44,811 INFO L225 Difference]: With dead ends: 1133 [2025-01-09 03:49:44,811 INFO L226 Difference]: Without dead ends: 598 [2025-01-09 03:49:44,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:49:44,816 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 4 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5154 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:44,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5154 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:44,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-01-09 03:49:44,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 597. [2025-01-09 03:49:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 442 states have (on average 1.493212669683258) internal successors, (660), 462 states have internal predecessors, (660), 109 states have call successors, (109), 43 states have call predecessors, (109), 45 states have return successors, (112), 108 states have call predecessors, (112), 108 states have call successors, (112) [2025-01-09 03:49:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 881 transitions. [2025-01-09 03:49:44,857 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 881 transitions. Word has length 175 [2025-01-09 03:49:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:44,858 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 881 transitions. [2025-01-09 03:49:44,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 7 states have internal predecessors, (102), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:49:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 881 transitions. [2025-01-09 03:49:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 03:49:44,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:44,863 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:44,874 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:49:45,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:45,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:45,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash -582876829, now seen corresponding path program 1 times [2025-01-09 03:49:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:45,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987706084] [2025-01-09 03:49:45,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:45,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 03:49:45,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 03:49:45,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:45,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-09 03:49:45,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:45,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987706084] [2025-01-09 03:49:45,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987706084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:45,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:45,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:49:45,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744838586] [2025-01-09 03:49:45,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:45,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:49:45,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:45,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:49:45,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:49:45,362 INFO L87 Difference]: Start difference. First operand 597 states and 881 transitions. Second operand has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:49:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:45,465 INFO L93 Difference]: Finished difference Result 1119 states and 1659 transitions. [2025-01-09 03:49:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:49:45,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 176 [2025-01-09 03:49:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:45,473 INFO L225 Difference]: With dead ends: 1119 [2025-01-09 03:49:45,473 INFO L226 Difference]: Without dead ends: 600 [2025-01-09 03:49:45,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:45,476 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 4 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5154 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:45,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5154 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-01-09 03:49:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 599. [2025-01-09 03:49:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 443 states have (on average 1.492099322799097) internal successors, (661), 463 states have internal predecessors, (661), 109 states have call successors, (109), 43 states have call predecessors, (109), 46 states have return successors, (113), 109 states have call predecessors, (113), 108 states have call successors, (113) [2025-01-09 03:49:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 883 transitions. [2025-01-09 03:49:45,511 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 883 transitions. Word has length 176 [2025-01-09 03:49:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:45,512 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 883 transitions. [2025-01-09 03:49:45,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:49:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 883 transitions. [2025-01-09 03:49:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 03:49:45,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:45,517 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:45,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:49:45,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:45,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:45,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1328328133, now seen corresponding path program 2 times [2025-01-09 03:49:45,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:45,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355238757] [2025-01-09 03:49:45,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:49:45,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:45,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 177 statements into 2 equivalence classes. [2025-01-09 03:49:45,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 88 of 177 statements. [2025-01-09 03:49:45,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:49:45,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 03:49:45,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:45,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355238757] [2025-01-09 03:49:45,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355238757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:45,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:45,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:49:45,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355600874] [2025-01-09 03:49:45,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:45,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:49:45,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:45,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:49:45,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:49:45,702 INFO L87 Difference]: Start difference. First operand 599 states and 883 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 03:49:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:45,753 INFO L93 Difference]: Finished difference Result 605 states and 891 transitions. [2025-01-09 03:49:45,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:49:45,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2025-01-09 03:49:45,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:45,760 INFO L225 Difference]: With dead ends: 605 [2025-01-09 03:49:45,760 INFO L226 Difference]: Without dead ends: 603 [2025-01-09 03:49:45,761 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:49:45,763 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 0 mSDsluCounter, 4346 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5217 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:49:45,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5217 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-01-09 03:49:45,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2025-01-09 03:49:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 446 states have (on average 1.4887892376681615) internal successors, (664), 466 states have internal predecessors, (664), 109 states have call successors, (109), 43 states have call predecessors, (109), 47 states have return successors, (116), 110 states have call predecessors, (116), 108 states have call successors, (116) [2025-01-09 03:49:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 889 transitions. [2025-01-09 03:49:45,792 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 889 transitions. Word has length 177 [2025-01-09 03:49:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:45,793 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 889 transitions. [2025-01-09 03:49:45,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 03:49:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 889 transitions. [2025-01-09 03:49:45,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 03:49:45,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:45,798 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:45,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:49:45,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:45,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1560607180, now seen corresponding path program 1 times [2025-01-09 03:49:45,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:45,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581303057] [2025-01-09 03:49:45,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:45,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:45,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 03:49:45,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 03:49:45,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:45,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:46,109 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-01-09 03:49:46,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:46,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581303057] [2025-01-09 03:49:46,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581303057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:46,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:46,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:49:46,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836317495] [2025-01-09 03:49:46,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:46,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:49:46,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:46,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:49:46,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:49:46,112 INFO L87 Difference]: Start difference. First operand 603 states and 889 transitions. Second operand has 7 states, 6 states have (on average 18.666666666666668) internal successors, (112), 7 states have internal predecessors, (112), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2025-01-09 03:49:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:46,223 INFO L93 Difference]: Finished difference Result 1131 states and 1677 transitions. [2025-01-09 03:49:46,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:49:46,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.666666666666668) internal successors, (112), 7 states have internal predecessors, (112), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) Word has length 193 [2025-01-09 03:49:46,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:46,229 INFO L225 Difference]: With dead ends: 1131 [2025-01-09 03:49:46,229 INFO L226 Difference]: Without dead ends: 608 [2025-01-09 03:49:46,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:46,232 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 2 mSDsluCounter, 4312 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:46,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-01-09 03:49:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 605. [2025-01-09 03:49:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 447 states have (on average 1.487695749440716) internal successors, (665), 468 states have internal predecessors, (665), 109 states have call successors, (109), 43 states have call predecessors, (109), 48 states have return successors, (119), 110 states have call predecessors, (119), 108 states have call successors, (119) [2025-01-09 03:49:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 893 transitions. [2025-01-09 03:49:46,258 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 893 transitions. Word has length 193 [2025-01-09 03:49:46,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:46,259 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 893 transitions. [2025-01-09 03:49:46,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.666666666666668) internal successors, (112), 7 states have internal predecessors, (112), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2025-01-09 03:49:46,259 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 893 transitions. [2025-01-09 03:49:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 03:49:46,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:46,263 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:46,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:49:46,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:46,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2092492631, now seen corresponding path program 1 times [2025-01-09 03:49:46,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:46,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771307323] [2025-01-09 03:49:46,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:46,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 03:49:46,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 03:49:46,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:46,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-09 03:49:46,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:46,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771307323] [2025-01-09 03:49:46,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771307323] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:46,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215048011] [2025-01-09 03:49:46,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:46,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:46,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:46,464 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:49:46,466 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:49:46,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 03:49:46,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 03:49:46,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:46,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:46,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:49:46,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 03:49:47,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:47,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215048011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:47,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:47,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 03:49:47,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978234750] [2025-01-09 03:49:47,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:47,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:47,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:47,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:47,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:49:47,036 INFO L87 Difference]: Start difference. First operand 605 states and 893 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:49:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:47,125 INFO L93 Difference]: Finished difference Result 1736 states and 2624 transitions. [2025-01-09 03:49:47,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:47,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 181 [2025-01-09 03:49:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:47,131 INFO L225 Difference]: With dead ends: 1736 [2025-01-09 03:49:47,131 INFO L226 Difference]: Without dead ends: 600 [2025-01-09 03:49:47,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:49:47,137 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 729 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:47,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1763 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-01-09 03:49:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-01-09 03:49:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 445 states have (on average 1.4786516853932585) internal successors, (658), 464 states have internal predecessors, (658), 106 states have call successors, (106), 44 states have call predecessors, (106), 48 states have return successors, (113), 106 states have call predecessors, (113), 105 states have call successors, (113) [2025-01-09 03:49:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 877 transitions. [2025-01-09 03:49:47,164 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 877 transitions. Word has length 181 [2025-01-09 03:49:47,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:47,165 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 877 transitions. [2025-01-09 03:49:47,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:49:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 877 transitions. [2025-01-09 03:49:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 03:49:47,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:47,170 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:47,180 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:49:47,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:47,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:47,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:47,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1719889274, now seen corresponding path program 1 times [2025-01-09 03:49:47,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:47,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106862127] [2025-01-09 03:49:47,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:47,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:47,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 03:49:47,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 03:49:47,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:47,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:49:47,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106862127] [2025-01-09 03:49:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106862127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:47,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:47,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:47,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757513062] [2025-01-09 03:49:47,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:47,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:47,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:47,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:47,515 INFO L87 Difference]: Start difference. First operand 600 states and 877 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 03:49:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:47,558 INFO L93 Difference]: Finished difference Result 1169 states and 1724 transitions. [2025-01-09 03:49:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:47,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 227 [2025-01-09 03:49:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:47,564 INFO L225 Difference]: With dead ends: 1169 [2025-01-09 03:49:47,564 INFO L226 Difference]: Without dead ends: 599 [2025-01-09 03:49:47,566 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:49:47,566 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 826 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:47,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 885 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-01-09 03:49:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-01-09 03:49:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 445 states have (on average 1.4741573033707864) internal successors, (656), 463 states have internal predecessors, (656), 105 states have call successors, (105), 44 states have call predecessors, (105), 48 states have return successors, (112), 105 states have call predecessors, (112), 104 states have call successors, (112) [2025-01-09 03:49:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 873 transitions. [2025-01-09 03:49:47,597 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 873 transitions. Word has length 227 [2025-01-09 03:49:47,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:47,598 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 873 transitions. [2025-01-09 03:49:47,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 03:49:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 873 transitions. [2025-01-09 03:49:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 03:49:47,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:47,602 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:47,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:49:47,603 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:47,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:47,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1982418799, now seen corresponding path program 1 times [2025-01-09 03:49:47,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:47,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638015674] [2025-01-09 03:49:47,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:47,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:47,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 03:49:47,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 03:49:47,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:47,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:49:47,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638015674] [2025-01-09 03:49:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638015674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:47,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:47,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:47,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726730168] [2025-01-09 03:49:47,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:47,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:47,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:47,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:47,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:47,735 INFO L87 Difference]: Start difference. First operand 599 states and 873 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 03:49:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:47,808 INFO L93 Difference]: Finished difference Result 1149 states and 1682 transitions. [2025-01-09 03:49:47,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:47,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 221 [2025-01-09 03:49:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:47,814 INFO L225 Difference]: With dead ends: 1149 [2025-01-09 03:49:47,814 INFO L226 Difference]: Without dead ends: 596 [2025-01-09 03:49:47,817 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:49:47,817 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 798 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:47,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 862 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-01-09 03:49:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 588. [2025-01-09 03:49:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 441 states have (on average 1.4535147392290249) internal successors, (641), 452 states have internal predecessors, (641), 102 states have call successors, (102), 44 states have call predecessors, (102), 44 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2025-01-09 03:49:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 844 transitions. [2025-01-09 03:49:47,854 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 844 transitions. Word has length 221 [2025-01-09 03:49:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:47,854 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 844 transitions. [2025-01-09 03:49:47,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 03:49:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 844 transitions. [2025-01-09 03:49:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-09 03:49:47,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:47,860 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:47,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:49:47,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:47,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash 982693570, now seen corresponding path program 1 times [2025-01-09 03:49:47,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:47,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169699337] [2025-01-09 03:49:47,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:47,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:47,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 03:49:47,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 03:49:47,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:47,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-01-09 03:49:48,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169699337] [2025-01-09 03:49:48,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169699337] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917224291] [2025-01-09 03:49:48,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:48,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:48,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:48,228 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:49:48,230 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:49:48,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 03:49:48,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 03:49:48,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:48,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:48,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 1690 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:49:48,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-01-09 03:49:48,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:48,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917224291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:48,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:48,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:49:48,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242014343] [2025-01-09 03:49:48,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:48,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:48,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:48,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:48,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:49:48,722 INFO L87 Difference]: Start difference. First operand 588 states and 844 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 03:49:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:48,769 INFO L93 Difference]: Finished difference Result 1196 states and 1749 transitions. [2025-01-09 03:49:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 237 [2025-01-09 03:49:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:48,775 INFO L225 Difference]: With dead ends: 1196 [2025-01-09 03:49:48,775 INFO L226 Difference]: Without dead ends: 685 [2025-01-09 03:49:48,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 237 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:49:48,778 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 165 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1642 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:49:48,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1642 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-01-09 03:49:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 677. [2025-01-09 03:49:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 516 states have (on average 1.4689922480620154) internal successors, (758), 527 states have internal predecessors, (758), 116 states have call successors, (116), 44 states have call predecessors, (116), 44 states have return successors, (115), 114 states have call predecessors, (115), 115 states have call successors, (115) [2025-01-09 03:49:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 989 transitions. [2025-01-09 03:49:48,817 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 989 transitions. Word has length 237 [2025-01-09 03:49:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:48,817 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 989 transitions. [2025-01-09 03:49:48,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 03:49:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 989 transitions. [2025-01-09 03:49:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 03:49:48,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:48,823 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:48,834 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:49:49,026 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,SelfDestructingSolverStorable9 [2025-01-09 03:49:49,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:49,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1663938526, now seen corresponding path program 1 times [2025-01-09 03:49:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:49,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149196582] [2025-01-09 03:49:49,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:49,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 03:49:49,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 03:49:49,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:49,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-09 03:49:49,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:49,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149196582] [2025-01-09 03:49:49,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149196582] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:49,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544604965] [2025-01-09 03:49:49,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:49,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:49,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:49,315 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:49:49,317 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:49:49,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 03:49:49,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 03:49:49,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:49,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:49,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1659 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 03:49:49,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-01-09 03:49:49,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:49,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544604965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:49,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-01-09 03:49:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851199466] [2025-01-09 03:49:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:49,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:49:49,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:49,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:49:49,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:49:49,854 INFO L87 Difference]: Start difference. First operand 677 states and 989 transitions. Second operand has 8 states, 6 states have (on average 22.666666666666668) internal successors, (136), 8 states have internal predecessors, (136), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-01-09 03:49:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:49,978 INFO L93 Difference]: Finished difference Result 1301 states and 1915 transitions. [2025-01-09 03:49:49,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:49:49,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 22.666666666666668) internal successors, (136), 8 states have internal predecessors, (136), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) Word has length 229 [2025-01-09 03:49:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:49,985 INFO L225 Difference]: With dead ends: 1301 [2025-01-09 03:49:49,985 INFO L226 Difference]: Without dead ends: 679 [2025-01-09 03:49:49,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 224 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:49:49,988 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 4 mSDsluCounter, 4963 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5793 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:49:49,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5793 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-01-09 03:49:50,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2025-01-09 03:49:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 517 states have (on average 1.4680851063829787) internal successors, (759), 529 states have internal predecessors, (759), 116 states have call successors, (116), 44 states have call predecessors, (116), 45 states have return successors, (117), 114 states have call predecessors, (117), 115 states have call successors, (117) [2025-01-09 03:49:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 992 transitions. [2025-01-09 03:49:50,023 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 992 transitions. Word has length 229 [2025-01-09 03:49:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:50,024 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 992 transitions. [2025-01-09 03:49:50,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 22.666666666666668) internal successors, (136), 8 states have internal predecessors, (136), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-01-09 03:49:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 992 transitions. [2025-01-09 03:49:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 03:49:50,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:50,028 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:50,039 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:49:50,232 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,SelfDestructingSolverStorable10 [2025-01-09 03:49:50,232 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:50,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:50,233 INFO L85 PathProgramCache]: Analyzing trace with hash 518052316, now seen corresponding path program 1 times [2025-01-09 03:49:50,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:50,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029232448] [2025-01-09 03:49:50,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:50,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:50,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 03:49:50,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 03:49:50,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:50,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-01-09 03:49:50,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:50,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029232448] [2025-01-09 03:49:50,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029232448] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:50,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032398669] [2025-01-09 03:49:50,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:50,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:50,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:50,490 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:49:50,492 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:49:50,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 03:49:50,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 03:49:50,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:50,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:50,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 1660 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:49:50,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-01-09 03:49:51,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:51,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032398669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:51,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:51,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-01-09 03:49:51,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029855566] [2025-01-09 03:49:51,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:51,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:49:51,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:51,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:49:51,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:49:51,048 INFO L87 Difference]: Start difference. First operand 679 states and 992 transitions. Second operand has 6 states, 5 states have (on average 27.6) internal successors, (138), 6 states have internal predecessors, (138), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-01-09 03:49:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:51,165 INFO L93 Difference]: Finished difference Result 1302 states and 1919 transitions. [2025-01-09 03:49:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:49:51,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.6) internal successors, (138), 6 states have internal predecessors, (138), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 230 [2025-01-09 03:49:51,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:51,174 INFO L225 Difference]: With dead ends: 1302 [2025-01-09 03:49:51,174 INFO L226 Difference]: Without dead ends: 681 [2025-01-09 03:49:51,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 227 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:49:51,178 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 2 mSDsluCounter, 3303 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4133 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:51,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4133 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:51,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-01-09 03:49:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2025-01-09 03:49:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 518 states have (on average 1.4671814671814671) internal successors, (760), 531 states have internal predecessors, (760), 116 states have call successors, (116), 44 states have call predecessors, (116), 46 states have return successors, (122), 114 states have call predecessors, (122), 115 states have call successors, (122) [2025-01-09 03:49:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 998 transitions. [2025-01-09 03:49:51,231 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 998 transitions. Word has length 230 [2025-01-09 03:49:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:51,231 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 998 transitions. [2025-01-09 03:49:51,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.6) internal successors, (138), 6 states have internal predecessors, (138), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-01-09 03:49:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 998 transitions. [2025-01-09 03:49:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 03:49:51,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:51,238 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:51,249 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:49:51,442 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,SelfDestructingSolverStorable11 [2025-01-09 03:49:51,442 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:51,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash -152019573, now seen corresponding path program 1 times [2025-01-09 03:49:51,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:51,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810016244] [2025-01-09 03:49:51,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:51,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:51,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 03:49:51,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 03:49:51,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:51,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-09 03:49:51,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810016244] [2025-01-09 03:49:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810016244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:51,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:51,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:49:51,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308935619] [2025-01-09 03:49:51,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:51,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:49:51,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:51,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:49:51,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:51,743 INFO L87 Difference]: Start difference. First operand 681 states and 998 transitions. Second operand has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-01-09 03:49:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:51,849 INFO L93 Difference]: Finished difference Result 1290 states and 1906 transitions. [2025-01-09 03:49:51,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:49:51,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 224 [2025-01-09 03:49:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:51,857 INFO L225 Difference]: With dead ends: 1290 [2025-01-09 03:49:51,858 INFO L226 Difference]: Without dead ends: 681 [2025-01-09 03:49:51,860 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:49:51,862 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 4 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5800 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:49:51,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5800 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-01-09 03:49:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2025-01-09 03:49:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 518 states have (on average 1.4671814671814671) internal successors, (760), 531 states have internal predecessors, (760), 116 states have call successors, (116), 44 states have call predecessors, (116), 46 states have return successors, (121), 114 states have call predecessors, (121), 115 states have call successors, (121) [2025-01-09 03:49:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 997 transitions. [2025-01-09 03:49:51,901 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 997 transitions. Word has length 224 [2025-01-09 03:49:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:51,901 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 997 transitions. [2025-01-09 03:49:51,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-01-09 03:49:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 997 transitions. [2025-01-09 03:49:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 03:49:51,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:51,907 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:51,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:49:51,907 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:51,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:51,908 INFO L85 PathProgramCache]: Analyzing trace with hash -951678735, now seen corresponding path program 2 times [2025-01-09 03:49:51,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:51,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973847924] [2025-01-09 03:49:51,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:49:51,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:51,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 225 statements into 2 equivalence classes. [2025-01-09 03:49:51,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 107 of 225 statements. [2025-01-09 03:49:51,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:49:51,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 03:49:52,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:52,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973847924] [2025-01-09 03:49:52,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973847924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:52,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:52,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:49:52,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677266115] [2025-01-09 03:49:52,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:52,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:49:52,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:52,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:49:52,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:52,129 INFO L87 Difference]: Start difference. First operand 681 states and 997 transitions. Second operand has 8 states, 8 states have (on average 16.125) internal successors, (129), 7 states have internal predecessors, (129), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 03:49:52,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:52,716 INFO L93 Difference]: Finished difference Result 1645 states and 2410 transitions. [2025-01-09 03:49:52,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:49:52,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 7 states have internal predecessors, (129), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) Word has length 225 [2025-01-09 03:49:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:52,726 INFO L225 Difference]: With dead ends: 1645 [2025-01-09 03:49:52,726 INFO L226 Difference]: Without dead ends: 1331 [2025-01-09 03:49:52,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:49:52,729 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 795 mSDsluCounter, 4787 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 5639 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:52,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 5639 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:49:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-01-09 03:49:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1317. [2025-01-09 03:49:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1006 states have (on average 1.4801192842942346) internal successors, (1489), 1029 states have internal predecessors, (1489), 221 states have call successors, (221), 86 states have call predecessors, (221), 89 states have return successors, (235), 219 states have call predecessors, (235), 219 states have call successors, (235) [2025-01-09 03:49:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1945 transitions. [2025-01-09 03:49:52,816 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1945 transitions. Word has length 225 [2025-01-09 03:49:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:52,817 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1945 transitions. [2025-01-09 03:49:52,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 7 states have internal predecessors, (129), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 03:49:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1945 transitions. [2025-01-09 03:49:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-09 03:49:52,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:52,825 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:52,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:49:52,826 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:52,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:52,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1169188461, now seen corresponding path program 1 times [2025-01-09 03:49:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:52,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942651706] [2025-01-09 03:49:52,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:52,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:52,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 03:49:52,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 03:49:52,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:52,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-01-09 03:49:53,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:53,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942651706] [2025-01-09 03:49:53,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942651706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:53,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:53,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:49:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994171271] [2025-01-09 03:49:53,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:53,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:49:53,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:53,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:49:53,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:53,111 INFO L87 Difference]: Start difference. First operand 1317 states and 1945 transitions. Second operand has 8 states, 6 states have (on average 23.166666666666668) internal successors, (139), 8 states have internal predecessors, (139), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) [2025-01-09 03:49:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:53,265 INFO L93 Difference]: Finished difference Result 2545 states and 3783 transitions. [2025-01-09 03:49:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:49:53,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 23.166666666666668) internal successors, (139), 8 states have internal predecessors, (139), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) Word has length 249 [2025-01-09 03:49:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:53,276 INFO L225 Difference]: With dead ends: 2545 [2025-01-09 03:49:53,276 INFO L226 Difference]: Without dead ends: 1321 [2025-01-09 03:49:53,281 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:49:53,283 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 3 mSDsluCounter, 4974 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5806 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:49:53,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5806 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-01-09 03:49:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2025-01-09 03:49:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1008 states have (on average 1.4791666666666667) internal successors, (1491), 1033 states have internal predecessors, (1491), 221 states have call successors, (221), 86 states have call predecessors, (221), 91 states have return successors, (238), 219 states have call predecessors, (238), 219 states have call successors, (238) [2025-01-09 03:49:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1950 transitions. [2025-01-09 03:49:53,361 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1950 transitions. Word has length 249 [2025-01-09 03:49:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:53,361 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1950 transitions. [2025-01-09 03:49:53,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 23.166666666666668) internal successors, (139), 8 states have internal predecessors, (139), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) [2025-01-09 03:49:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1950 transitions. [2025-01-09 03:49:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 03:49:53,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:53,369 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:53,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:49:53,369 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:53,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash 141082967, now seen corresponding path program 1 times [2025-01-09 03:49:53,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:53,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270132166] [2025-01-09 03:49:53,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:53,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 03:49:53,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 03:49:53,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:53,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-01-09 03:49:53,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:53,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270132166] [2025-01-09 03:49:53,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270132166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:53,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:53,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:49:53,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710914937] [2025-01-09 03:49:53,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:53,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:49:53,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:53,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:49:53,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:49:53,596 INFO L87 Difference]: Start difference. First operand 1321 states and 1950 transitions. Second operand has 9 states, 7 states have (on average 20.0) internal successors, (140), 8 states have internal predecessors, (140), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-01-09 03:49:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:53,760 INFO L93 Difference]: Finished difference Result 2535 states and 3767 transitions. [2025-01-09 03:49:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:49:53,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 20.0) internal successors, (140), 8 states have internal predecessors, (140), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 234 [2025-01-09 03:49:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:53,769 INFO L225 Difference]: With dead ends: 2535 [2025-01-09 03:49:53,770 INFO L226 Difference]: Without dead ends: 1321 [2025-01-09 03:49:53,774 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:49:53,774 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 7 mSDsluCounter, 5738 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6562 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:49:53,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6562 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-01-09 03:49:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2025-01-09 03:49:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1008 states have (on average 1.4791666666666667) internal successors, (1491), 1033 states have internal predecessors, (1491), 221 states have call successors, (221), 86 states have call predecessors, (221), 91 states have return successors, (236), 219 states have call predecessors, (236), 219 states have call successors, (236) [2025-01-09 03:49:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1948 transitions. [2025-01-09 03:49:53,840 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1948 transitions. Word has length 234 [2025-01-09 03:49:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:53,841 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1948 transitions. [2025-01-09 03:49:53,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 20.0) internal successors, (140), 8 states have internal predecessors, (140), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-01-09 03:49:53,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1948 transitions. [2025-01-09 03:49:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 03:49:53,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:53,849 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:53,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:49:53,849 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:53,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:53,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1270230564, now seen corresponding path program 1 times [2025-01-09 03:49:53,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:53,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651503729] [2025-01-09 03:49:53,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:53,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:53,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 03:49:53,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 03:49:53,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:53,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-01-09 03:49:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:54,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651503729] [2025-01-09 03:49:54,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651503729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:54,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:54,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:49:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258107929] [2025-01-09 03:49:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:54,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:49:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:54,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:49:54,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:49:54,100 INFO L87 Difference]: Start difference. First operand 1321 states and 1948 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, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2025-01-09 03:49:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:54,278 INFO L93 Difference]: Finished difference Result 2545 states and 3783 transitions. [2025-01-09 03:49:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:49:54,279 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, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 228 [2025-01-09 03:49:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:54,288 INFO L225 Difference]: With dead ends: 2545 [2025-01-09 03:49:54,288 INFO L226 Difference]: Without dead ends: 1327 [2025-01-09 03:49:54,293 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:49:54,293 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 4 mSDsluCounter, 5752 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6578 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:49:54,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6578 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2025-01-09 03:49:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1325. [2025-01-09 03:49:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1010 states have (on average 1.4782178217821782) internal successors, (1493), 1037 states have internal predecessors, (1493), 221 states have call successors, (221), 86 states have call predecessors, (221), 93 states have return successors, (243), 219 states have call predecessors, (243), 219 states have call successors, (243) [2025-01-09 03:49:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1957 transitions. [2025-01-09 03:49:54,374 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1957 transitions. Word has length 228 [2025-01-09 03:49:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:54,375 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1957 transitions. [2025-01-09 03:49:54,375 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, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2025-01-09 03:49:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1957 transitions. [2025-01-09 03:49:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-01-09 03:49:54,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:54,381 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:54,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:49:54,382 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:54,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:54,382 INFO L85 PathProgramCache]: Analyzing trace with hash -910123315, now seen corresponding path program 1 times [2025-01-09 03:49:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:54,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871916588] [2025-01-09 03:49:54,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:54,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:54,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 03:49:54,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 03:49:54,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:54,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-01-09 03:49:54,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:54,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871916588] [2025-01-09 03:49:54,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871916588] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:54,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689747464] [2025-01-09 03:49:54,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:54,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:54,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:54,522 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:49:54,523 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:49:54,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 03:49:54,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 03:49:54,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:54,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:54,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1732 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:49:54,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-01-09 03:49:55,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:55,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689747464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:55,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:55,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 03:49:55,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59276411] [2025-01-09 03:49:55,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:55,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:55,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:55,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:55,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:49:55,178 INFO L87 Difference]: Start difference. First operand 1325 states and 1957 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-01-09 03:49:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:55,318 INFO L93 Difference]: Finished difference Result 3185 states and 4704 transitions. [2025-01-09 03:49:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:55,319 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), 3 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 252 [2025-01-09 03:49:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:55,338 INFO L225 Difference]: With dead ends: 3185 [2025-01-09 03:49:55,338 INFO L226 Difference]: Without dead ends: 2559 [2025-01-09 03:49:55,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:49:55,344 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 660 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:55,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1681 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2025-01-09 03:49:55,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2557. [2025-01-09 03:49:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 1957 states have (on average 1.4823709759836485) internal successors, (2901), 2003 states have internal predecessors, (2901), 414 states have call successors, (414), 171 states have call predecessors, (414), 185 states have return successors, (480), 412 states have call predecessors, (480), 410 states have call successors, (480) [2025-01-09 03:49:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3795 transitions. [2025-01-09 03:49:55,522 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3795 transitions. Word has length 252 [2025-01-09 03:49:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:55,523 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 3795 transitions. [2025-01-09 03:49:55,523 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), 3 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-01-09 03:49:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3795 transitions. [2025-01-09 03:49:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-09 03:49:55,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:55,534 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:55,545 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:49:55,734 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:49:55,734 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:55,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1900455964, now seen corresponding path program 1 times [2025-01-09 03:49:55,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:55,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056959201] [2025-01-09 03:49:55,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:55,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:55,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 03:49:55,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 03:49:55,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:55,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:49:55,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056959201] [2025-01-09 03:49:55,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056959201] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6454848] [2025-01-09 03:49:55,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:55,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:55,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:55,863 INFO L229 MonitoredProcess]: Starting monitored process 9 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:49:55,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 03:49:56,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 03:49:56,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 03:49:56,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:56,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:56,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1666 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:49:56,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:49:56,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:49:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:49:56,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6454848] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:49:56,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:49:56,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:49:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881602822] [2025-01-09 03:49:56,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:49:56,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:49:56,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:56,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:49:56,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:49:56,511 INFO L87 Difference]: Start difference. First operand 2557 states and 3795 transitions. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 2 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 03:49:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:56,803 INFO L93 Difference]: Finished difference Result 6009 states and 9182 transitions. [2025-01-09 03:49:56,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:49:56,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 2 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 236 [2025-01-09 03:49:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:56,834 INFO L225 Difference]: With dead ends: 6009 [2025-01-09 03:49:56,834 INFO L226 Difference]: Without dead ends: 4785 [2025-01-09 03:49:56,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 469 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:49:56,842 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 854 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:56,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 2926 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:49:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2025-01-09 03:49:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4689. [2025-01-09 03:49:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 3773 states have (on average 1.530082162735224) internal successors, (5773), 3819 states have internal predecessors, (5773), 730 states have call successors, (730), 171 states have call predecessors, (730), 185 states have return successors, (846), 728 states have call predecessors, (846), 726 states have call successors, (846) [2025-01-09 03:49:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 7349 transitions. [2025-01-09 03:49:57,065 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 7349 transitions. Word has length 236 [2025-01-09 03:49:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:57,066 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 7349 transitions. [2025-01-09 03:49:57,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 2 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 03:49:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 7349 transitions. [2025-01-09 03:49:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 03:49:57,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:57,088 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:57,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 03:49:57,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:57,290 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:57,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:57,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1904616209, now seen corresponding path program 1 times [2025-01-09 03:49:57,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:57,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327874202] [2025-01-09 03:49:57,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:57,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:57,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 03:49:57,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 03:49:57,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:57,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:49:57,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:57,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327874202] [2025-01-09 03:49:57,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327874202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:57,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:57,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:57,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60629232] [2025-01-09 03:49:57,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:57,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:57,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:57,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:57,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:57,376 INFO L87 Difference]: Start difference. First operand 4689 states and 7349 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 03:49:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:57,538 INFO L93 Difference]: Finished difference Result 10989 states and 17460 transitions. [2025-01-09 03:49:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:57,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 234 [2025-01-09 03:49:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:57,583 INFO L225 Difference]: With dead ends: 10989 [2025-01-09 03:49:57,583 INFO L226 Difference]: Without dead ends: 6697 [2025-01-09 03:49:57,602 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:49:57,603 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 163 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1674 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:49:57,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1674 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6697 states. [2025-01-09 03:49:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6697 to 6665. [2025-01-09 03:49:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 5433 states have (on average 1.5404012516105283) internal successors, (8369), 5479 states have internal predecessors, (8369), 1046 states have call successors, (1046), 171 states have call predecessors, (1046), 185 states have return successors, (1212), 1044 states have call predecessors, (1212), 1042 states have call successors, (1212) [2025-01-09 03:49:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 10627 transitions. [2025-01-09 03:49:57,949 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 10627 transitions. Word has length 234 [2025-01-09 03:49:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:57,949 INFO L471 AbstractCegarLoop]: Abstraction has 6665 states and 10627 transitions. [2025-01-09 03:49:57,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 03:49:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 10627 transitions. [2025-01-09 03:49:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-01-09 03:49:57,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:57,981 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:57,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:49:57,981 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:57,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:57,982 INFO L85 PathProgramCache]: Analyzing trace with hash -970641906, now seen corresponding path program 1 times [2025-01-09 03:49:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469796403] [2025-01-09 03:49:57,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:58,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-09 03:49:58,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-09 03:49:58,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:58,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:49:58,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469796403] [2025-01-09 03:49:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469796403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:58,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920475092] [2025-01-09 03:49:58,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:58,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:58,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:58,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:58,057 INFO L87 Difference]: Start difference. First operand 6665 states and 10627 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, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 03:49:58,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:58,323 INFO L93 Difference]: Finished difference Result 15909 states and 25606 transitions. [2025-01-09 03:49:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:58,324 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, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 242 [2025-01-09 03:49:58,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:58,379 INFO L225 Difference]: With dead ends: 15909 [2025-01-09 03:49:58,380 INFO L226 Difference]: Without dead ends: 9885 [2025-01-09 03:49:58,404 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:49:58,406 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 161 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1674 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:49:58,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1674 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9885 states. [2025-01-09 03:49:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9885 to 9853. [2025-01-09 03:49:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9853 states, 8145 states have (on average 1.5519950890116636) internal successors, (12641), 8191 states have internal predecessors, (12641), 1522 states have call successors, (1522), 171 states have call predecessors, (1522), 185 states have return successors, (1720), 1520 states have call predecessors, (1720), 1518 states have call successors, (1720) [2025-01-09 03:49:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9853 states to 9853 states and 15883 transitions. [2025-01-09 03:49:58,892 INFO L78 Accepts]: Start accepts. Automaton has 9853 states and 15883 transitions. Word has length 242 [2025-01-09 03:49:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:58,893 INFO L471 AbstractCegarLoop]: Abstraction has 9853 states and 15883 transitions. [2025-01-09 03:49:58,893 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, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 03:49:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 9853 states and 15883 transitions. [2025-01-09 03:49:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-01-09 03:49:58,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:58,946 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:58,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:49:58,946 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:58,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:58,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1354511409, now seen corresponding path program 1 times [2025-01-09 03:49:58,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:58,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123146609] [2025-01-09 03:49:58,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:58,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:58,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-09 03:49:58,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-09 03:49:58,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:58,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:49:59,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:59,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123146609] [2025-01-09 03:49:59,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123146609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:59,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:59,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:59,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561475513] [2025-01-09 03:49:59,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:59,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:59,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:59,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:59,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:59,056 INFO L87 Difference]: Start difference. First operand 9853 states and 15883 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, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 03:49:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:59,508 INFO L93 Difference]: Finished difference Result 23393 states and 38054 transitions. [2025-01-09 03:49:59,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:59,509 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, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 243 [2025-01-09 03:49:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:59,587 INFO L225 Difference]: With dead ends: 23393 [2025-01-09 03:49:59,588 INFO L226 Difference]: Without dead ends: 14793 [2025-01-09 03:49:59,624 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:49:59,626 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 159 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1669 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:49:59,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1669 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14793 states. [2025-01-09 03:50:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14793 to 14761. [2025-01-09 03:50:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14761 states, 12405 states have (on average 1.562031438935913) internal successors, (19377), 12451 states have internal predecessors, (19377), 2170 states have call successors, (2170), 171 states have call predecessors, (2170), 185 states have return successors, (2468), 2168 states have call predecessors, (2468), 2166 states have call successors, (2468) [2025-01-09 03:50:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14761 states to 14761 states and 24015 transitions. [2025-01-09 03:50:00,354 INFO L78 Accepts]: Start accepts. Automaton has 14761 states and 24015 transitions. Word has length 243 [2025-01-09 03:50:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:00,355 INFO L471 AbstractCegarLoop]: Abstraction has 14761 states and 24015 transitions. [2025-01-09 03:50:00,355 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, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 03:50:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 14761 states and 24015 transitions. [2025-01-09 03:50:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-09 03:50:00,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:00,413 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:00,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:50:00,413 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:00,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1078834207, now seen corresponding path program 1 times [2025-01-09 03:50:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:00,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569919022] [2025-01-09 03:50:00,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:00,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:00,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 03:50:00,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 03:50:00,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:00,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:50:00,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:00,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569919022] [2025-01-09 03:50:00,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569919022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:00,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:00,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:00,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098303206] [2025-01-09 03:50:00,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:00,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:00,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:00,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:00,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:00,507 INFO L87 Difference]: Start difference. First operand 14761 states and 24015 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, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 03:50:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:01,038 INFO L93 Difference]: Finished difference Result 35217 states and 57782 transitions. [2025-01-09 03:50:01,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:01,038 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, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 237 [2025-01-09 03:50:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:01,148 INFO L225 Difference]: With dead ends: 35217 [2025-01-09 03:50:01,149 INFO L226 Difference]: Without dead ends: 22717 [2025-01-09 03:50:01,186 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:50:01,186 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 157 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1669 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:50:01,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1669 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:01,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22717 states. [2025-01-09 03:50:02,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22717 to 22685. [2025-01-09 03:50:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22685 states, 19349 states have (on average 1.5705721225903146) internal successors, (30389), 19395 states have internal predecessors, (30389), 3150 states have call successors, (3150), 171 states have call predecessors, (3150), 185 states have return successors, (3614), 3148 states have call predecessors, (3614), 3146 states have call successors, (3614) [2025-01-09 03:50:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22685 states to 22685 states and 37153 transitions. [2025-01-09 03:50:02,166 INFO L78 Accepts]: Start accepts. Automaton has 22685 states and 37153 transitions. Word has length 237 [2025-01-09 03:50:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:02,167 INFO L471 AbstractCegarLoop]: Abstraction has 22685 states and 37153 transitions. [2025-01-09 03:50:02,167 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, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 03:50:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 22685 states and 37153 transitions. [2025-01-09 03:50:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-09 03:50:02,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:02,248 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:02,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:50:02,248 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:02,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:02,249 INFO L85 PathProgramCache]: Analyzing trace with hash -714269939, now seen corresponding path program 1 times [2025-01-09 03:50:02,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:02,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803293806] [2025-01-09 03:50:02,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:02,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:02,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 03:50:02,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 03:50:02,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:02,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:50:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:02,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803293806] [2025-01-09 03:50:02,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803293806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:02,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:02,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362934243] [2025-01-09 03:50:02,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:02,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:02,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:02,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:02,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:02,336 INFO L87 Difference]: Start difference. First operand 22685 states and 37153 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, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 03:50:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:03,541 INFO L93 Difference]: Finished difference Result 54881 states and 90448 transitions. [2025-01-09 03:50:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:03,542 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, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 238 [2025-01-09 03:50:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:03,766 INFO L225 Difference]: With dead ends: 54881 [2025-01-09 03:50:03,767 INFO L226 Difference]: Without dead ends: 35997 [2025-01-09 03:50:03,837 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:50:03,838 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 155 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 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:50:03,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 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:50:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35997 states. [2025-01-09 03:50:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35997 to 35965. [2025-01-09 03:50:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35965 states, 30657 states have (on average 1.567831164171315) internal successors, (48065), 30703 states have internal predecessors, (48065), 5122 states have call successors, (5122), 171 states have call predecessors, (5122), 185 states have return successors, (5874), 5120 states have call predecessors, (5874), 5118 states have call successors, (5874) [2025-01-09 03:50:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35965 states to 35965 states and 59061 transitions. [2025-01-09 03:50:05,551 INFO L78 Accepts]: Start accepts. Automaton has 35965 states and 59061 transitions. Word has length 238 [2025-01-09 03:50:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:05,551 INFO L471 AbstractCegarLoop]: Abstraction has 35965 states and 59061 transitions. [2025-01-09 03:50:05,552 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, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 03:50:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 35965 states and 59061 transitions. [2025-01-09 03:50:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-01-09 03:50:05,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:05,688 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:50:05,688 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:05,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:05,690 INFO L85 PathProgramCache]: Analyzing trace with hash 630781388, now seen corresponding path program 1 times [2025-01-09 03:50:05,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:05,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251902873] [2025-01-09 03:50:05,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:05,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:05,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-01-09 03:50:05,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-01-09 03:50:05,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:05,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:50:05,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251902873] [2025-01-09 03:50:05,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251902873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:05,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:05,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:05,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62128531] [2025-01-09 03:50:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:05,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:05,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:05,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:05,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:05,775 INFO L87 Difference]: Start difference. First operand 35965 states and 59061 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, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 03:50:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:07,439 INFO L93 Difference]: Finished difference Result 90161 states and 149120 transitions. [2025-01-09 03:50:07,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:07,440 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, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 239 [2025-01-09 03:50:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:07,808 INFO L225 Difference]: With dead ends: 90161 [2025-01-09 03:50:07,808 INFO L226 Difference]: Without dead ends: 59917 [2025-01-09 03:50:08,097 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:50:08,098 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 153 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1682 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:50:08,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1682 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:08,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59917 states. [2025-01-09 03:50:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59917 to 59885. [2025-01-09 03:50:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59885 states, 51289 states have (on average 1.573378307239369) internal successors, (80697), 51335 states have internal predecessors, (80697), 8410 states have call successors, (8410), 171 states have call predecessors, (8410), 185 states have return successors, (9540), 8408 states have call predecessors, (9540), 8406 states have call successors, (9540) [2025-01-09 03:50:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59885 states to 59885 states and 98647 transitions. [2025-01-09 03:50:10,129 INFO L78 Accepts]: Start accepts. Automaton has 59885 states and 98647 transitions. Word has length 239 [2025-01-09 03:50:10,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:10,130 INFO L471 AbstractCegarLoop]: Abstraction has 59885 states and 98647 transitions. [2025-01-09 03:50:10,130 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, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 03:50:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 59885 states and 98647 transitions. [2025-01-09 03:50:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 03:50:10,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:10,624 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:10,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 03:50:10,624 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:10,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1848173043, now seen corresponding path program 1 times [2025-01-09 03:50:10,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:10,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994499995] [2025-01-09 03:50:10,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:10,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:10,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 03:50:10,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 03:50:10,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:10,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:50:10,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:10,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994499995] [2025-01-09 03:50:10,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994499995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:10,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:10,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351464884] [2025-01-09 03:50:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:10,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:10,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:10,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:10,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:10,730 INFO L87 Difference]: Start difference. First operand 59885 states and 98647 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 03:50:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:13,538 INFO L93 Difference]: Finished difference Result 144445 states and 236932 transitions. [2025-01-09 03:50:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:13,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 247 [2025-01-09 03:50:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:14,181 INFO L225 Difference]: With dead ends: 144445 [2025-01-09 03:50:14,182 INFO L226 Difference]: Without dead ends: 94729 [2025-01-09 03:50:14,276 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:50:14,276 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 151 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1651 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:50:14,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1651 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:14,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94729 states. [2025-01-09 03:50:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94729 to 94697. [2025-01-09 03:50:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94697 states, 81289 states have (on average 1.5463961913666056) internal successors, (125705), 81335 states have internal predecessors, (125705), 13222 states have call successors, (13222), 171 states have call predecessors, (13222), 185 states have return successors, (15202), 13220 states have call predecessors, (15202), 13218 states have call successors, (15202) [2025-01-09 03:50:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94697 states to 94697 states and 154129 transitions. [2025-01-09 03:50:17,715 INFO L78 Accepts]: Start accepts. Automaton has 94697 states and 154129 transitions. Word has length 247 [2025-01-09 03:50:17,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:17,715 INFO L471 AbstractCegarLoop]: Abstraction has 94697 states and 154129 transitions. [2025-01-09 03:50:17,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 03:50:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 94697 states and 154129 transitions. [2025-01-09 03:50:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-09 03:50:18,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:18,067 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:18,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 03:50:18,069 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:18,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:18,070 INFO L85 PathProgramCache]: Analyzing trace with hash -349743597, now seen corresponding path program 1 times [2025-01-09 03:50:18,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:18,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439575117] [2025-01-09 03:50:18,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:18,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:18,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-09 03:50:18,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-09 03:50:18,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:18,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:50:18,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:18,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439575117] [2025-01-09 03:50:18,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439575117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:18,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:18,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:18,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657155984] [2025-01-09 03:50:18,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:18,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:18,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:18,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:18,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:18,148 INFO L87 Difference]: Start difference. First operand 94697 states and 154129 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 03:50:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:21,878 INFO L93 Difference]: Finished difference Result 250097 states and 408570 transitions. [2025-01-09 03:50:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:21,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 248 [2025-01-09 03:50:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:22,766 INFO L225 Difference]: With dead ends: 250097 [2025-01-09 03:50:22,767 INFO L226 Difference]: Without dead ends: 168701 [2025-01-09 03:50:22,968 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:50:22,969 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 149 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1673 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:50:22,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1673 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168701 states. [2025-01-09 03:50:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168701 to 168669. [2025-01-09 03:50:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168669 states, 145461 states have (on average 1.546070768109665) internal successors, (224893), 145507 states have internal predecessors, (224893), 23022 states have call successors, (23022), 171 states have call predecessors, (23022), 185 states have return successors, (26630), 23020 states have call predecessors, (26630), 23018 states have call successors, (26630) [2025-01-09 03:50:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168669 states to 168669 states and 274545 transitions. [2025-01-09 03:50:28,521 INFO L78 Accepts]: Start accepts. Automaton has 168669 states and 274545 transitions. Word has length 248 [2025-01-09 03:50:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:28,522 INFO L471 AbstractCegarLoop]: Abstraction has 168669 states and 274545 transitions. [2025-01-09 03:50:28,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 03:50:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 168669 states and 274545 transitions. [2025-01-09 03:50:29,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-01-09 03:50:29,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:29,587 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:29,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 03:50:29,587 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:29,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2026396103, now seen corresponding path program 1 times [2025-01-09 03:50:29,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:29,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585757908] [2025-01-09 03:50:29,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:29,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:29,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-09 03:50:29,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-09 03:50:29,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:29,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 03:50:29,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:29,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585757908] [2025-01-09 03:50:29,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585757908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:29,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:29,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:29,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152539154] [2025-01-09 03:50:29,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:29,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:29,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:29,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:29,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:29,668 INFO L87 Difference]: Start difference. First operand 168669 states and 274545 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, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29)