./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b548755c8e9cfcfe9ed8b47fb1ac823ac6821056e7770bffa975fdbf413b243 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:30:01,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:30:01,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:30:01,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:30:01,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:30:01,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:30:01,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:30:01,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:30:01,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:30:01,430 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:30:01,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:30:01,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:30:01,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:30:01,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:30:01,431 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:30:01,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:30:01,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:30:01,431 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:30:01,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:30:01,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:30:01,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:30:01,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:30:01,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:30:01,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:30:01,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:30:01,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:30:01,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:30:01,432 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:30:01,432 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:30:01,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:30:01,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:30:01,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:30:01,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:30:01,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:30:01,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:30:01,433 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:30:01,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:30:01,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:30:01,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:30:01,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:30:01,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:30:01,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:30:01,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:30:01,434 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b548755c8e9cfcfe9ed8b47fb1ac823ac6821056e7770bffa975fdbf413b243 [2025-03-08 05:30:01,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:30:01,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:30:01,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:30:01,672 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:30:01,672 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:30:01,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c [2025-03-08 05:30:02,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bc38e46/0e646ec3713748c3bef8a6fb516a86e0/FLAG921164e87 [2025-03-08 05:30:03,193 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:30:03,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c [2025-03-08 05:30:03,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bc38e46/0e646ec3713748c3bef8a6fb516a86e0/FLAG921164e87 [2025-03-08 05:30:03,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bc38e46/0e646ec3713748c3bef8a6fb516a86e0 [2025-03-08 05:30:03,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:30:03,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:30:03,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:30:03,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:30:03,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:30:03,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:30:03" (1/1) ... [2025-03-08 05:30:03,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b94c4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:03, skipping insertion in model container [2025-03-08 05:30:03,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:30:03" (1/1) ... [2025-03-08 05:30:03,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:30:03,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c[14867,14880] [2025-03-08 05:30:03,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:30:03,920 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:30:03,926 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-03-08 05:30:03,927 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [168] [2025-03-08 05:30:03,927 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [751] [2025-03-08 05:30:03,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [768] [2025-03-08 05:30:03,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [777] [2025-03-08 05:30:03,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1848] [2025-03-08 05:30:03,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2247] [2025-03-08 05:30:03,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2608] [2025-03-08 05:30:03,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [2874] [2025-03-08 05:30:03,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2893] [2025-03-08 05:30:03,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3097] [2025-03-08 05:30:03,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c[14867,14880] [2025-03-08 05:30:04,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:30:04,040 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:30:04,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04 WrapperNode [2025-03-08 05:30:04,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:30:04,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:30:04,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:30:04,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:30:04,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (1/1) ... [2025-03-08 05:30:04,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (1/1) ... [2025-03-08 05:30:04,105 INFO L138 Inliner]: procedures = 151, calls = 262, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1305 [2025-03-08 05:30:04,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:30:04,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:30:04,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:30:04,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:30:04,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (1/1) ... [2025-03-08 05:30:04,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (1/1) ... [2025-03-08 05:30:04,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (1/1) ... [2025-03-08 05:30:04,156 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:30:04,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (1/1) ... [2025-03-08 05:30:04,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (1/1) ... [2025-03-08 05:30:04,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (1/1) ... [2025-03-08 05:30:04,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (1/1) ... [2025-03-08 05:30:04,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (1/1) ... [2025-03-08 05:30:04,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (1/1) ... [2025-03-08 05:30:04,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:30:04,183 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:30:04,183 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:30:04,183 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:30:04,184 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (1/1) ... [2025-03-08 05:30:04,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:30:04,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:04,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:30:04,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:30:04,237 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:30:04,237 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:30:04,237 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-03-08 05:30:04,237 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-03-08 05:30:04,237 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-03-08 05:30:04,237 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-03-08 05:30:04,237 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:30:04,237 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:30:04,238 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:30:04,238 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:30:04,238 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:30:04,238 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:30:04,238 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:30:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:30:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-03-08 05:30:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-03-08 05:30:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-03-08 05:30:04,241 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:30:04,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:30:04,241 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:30:04,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:30:04,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:30:04,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:30:04,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:30:04,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:30:04,241 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:30:04,241 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:30:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-03-08 05:30:04,243 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-03-08 05:30:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-03-08 05:30:04,243 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-03-08 05:30:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:30:04,244 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:30:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:30:04,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:30:04,431 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:30:04,435 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:30:04,500 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3032: #res := ~retValue_acc~37; [2025-03-08 05:30:04,512 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2154: #res := ~retValue_acc~33; [2025-03-08 05:30:04,528 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L632: #res := ~retValue_acc~6; [2025-03-08 05:30:04,539 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1390: #res := ~retValue_acc~17; [2025-03-08 05:30:04,616 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: #res := ~retValue_acc~11; [2025-03-08 05:30:04,655 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1891-1: getEmailId_#res#1 := getEmailId_~retValue_acc~26#1; [2025-03-08 05:30:04,700 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2117: #res := ~retValue_acc~32; [2025-03-08 05:30:04,727 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965: #res := ~retValue_acc~28; [2025-03-08 05:30:04,788 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3070: #res#1 := ~retValue_acc~39#1; [2025-03-08 05:30:04,788 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3052-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~38#1; [2025-03-08 05:30:04,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1437-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~18#1; [2025-03-08 05:30:04,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1482: #res#1 := ~retValue_acc~19#1; [2025-03-08 05:30:04,899 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1706: #res := ~retValue_acc~22; [2025-03-08 05:30:04,908 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3094-1: createEmail_#res#1 := createEmail_~retValue_acc~41#1; [2025-03-08 05:30:04,913 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2080: #res := ~retValue_acc~31; [2025-03-08 05:30:04,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-1: getClientId_#res#1 := getClientId_~retValue_acc~24#1; [2025-03-08 05:30:04,992 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2228-1: isVerified_#res#1 := isVerified_~retValue_acc~35#1; [2025-03-08 05:30:04,992 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1778-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~23#1; [2025-03-08 05:30:04,997 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2191: #res := ~retValue_acc~34; [2025-03-08 05:30:05,017 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: #res := ~retValue_acc~0; [2025-03-08 05:30:05,034 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: #res := ~retValue_acc~15; [2025-03-08 05:30:05,050 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1343-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~16#1; [2025-03-08 05:30:05,348 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L598-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~4#1; [2025-03-08 05:30:05,349 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1545-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~20#1; [2025-03-08 05:30:05,349 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L589-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~3#1; [2025-03-08 05:30:05,349 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L607-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~5#1; [2025-03-08 05:30:05,349 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L165-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-08 05:30:05,349 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1652-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~21#1; [2025-03-08 05:30:05,355 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928: #res := ~retValue_acc~27; [2025-03-08 05:30:05,504 INFO L? ?]: Removed 623 outVars from TransFormulas that were not future-live. [2025-03-08 05:30:05,504 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:30:05,519 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:30:05,519 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:30:05,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:30:05 BoogieIcfgContainer [2025-03-08 05:30:05,519 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:30:05,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:30:05,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:30:05,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:30:05,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:30:03" (1/3) ... [2025-03-08 05:30:05,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75647b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:30:05, skipping insertion in model container [2025-03-08 05:30:05,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:04" (2/3) ... [2025-03-08 05:30:05,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75647b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:30:05, skipping insertion in model container [2025-03-08 05:30:05,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:30:05" (3/3) ... [2025-03-08 05:30:05,527 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_productSimulator.cil.c [2025-03-08 05:30:05,538 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:30:05,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_productSimulator.cil.c that has 44 procedures, 598 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:30:05,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:30:05,611 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;@fd65509, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:30:05,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:30:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 598 states, 444 states have (on average 1.5157657657657657) internal successors, (673), 464 states have internal predecessors, (673), 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-03-08 05:30:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 05:30:05,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:05,635 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-03-08 05:30:05,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:05,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:05,639 INFO L85 PathProgramCache]: Analyzing trace with hash 928966454, now seen corresponding path program 1 times [2025-03-08 05:30:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:05,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026718125] [2025-03-08 05:30:05,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:05,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:05,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 05:30:05,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 05:30:05,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:05,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 05:30:06,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:06,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026718125] [2025-03-08 05:30:06,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026718125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:06,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:06,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984446036] [2025-03-08 05:30:06,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:06,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:06,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:06,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:06,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:06,345 INFO L87 Difference]: Start difference. First operand has 598 states, 444 states have (on average 1.5157657657657657) internal successors, (673), 464 states have internal predecessors, (673), 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-03-08 05:30:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:06,489 INFO L93 Difference]: Finished difference Result 1159 states and 1740 transitions. [2025-03-08 05:30:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:06,491 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-03-08 05:30:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:06,503 INFO L225 Difference]: With dead ends: 1159 [2025-03-08 05:30:06,505 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 05:30:06,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:06,515 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 0 mSDsluCounter, 2642 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3527 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-03-08 05:30:06,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3527 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 05:30:06,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-08 05:30:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 438 states have (on average 1.4977168949771689) internal successors, (656), 457 states have internal predecessors, (656), 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-03-08 05:30:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 873 transitions. [2025-03-08 05:30:06,600 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 873 transitions. Word has length 164 [2025-03-08 05:30:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:06,602 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 873 transitions. [2025-03-08 05:30:06,602 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-03-08 05:30:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 873 transitions. [2025-03-08 05:30:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 05:30:06,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:06,609 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] [2025-03-08 05:30:06,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:30:06,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:06,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:06,610 INFO L85 PathProgramCache]: Analyzing trace with hash 171089395, now seen corresponding path program 1 times [2025-03-08 05:30:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:06,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899784475] [2025-03-08 05:30:06,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:06,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:06,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:30:06,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:30:06,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:06,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-08 05:30:06,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:06,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899784475] [2025-03-08 05:30:06,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899784475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:06,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512618241] [2025-03-08 05:30:06,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:06,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:06,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:06,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:06,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:30:07,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:30:07,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:30:07,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:07,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:07,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:30:07,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 05:30:07,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:07,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512618241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:07,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:07,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-08 05:30:07,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288138347] [2025-03-08 05:30:07,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:07,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:07,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:07,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:07,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:07,402 INFO L87 Difference]: Start difference. First operand 591 states and 873 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:30:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:07,450 INFO L93 Difference]: Finished difference Result 917 states and 1329 transitions. [2025-03-08 05:30:07,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:07,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 169 [2025-03-08 05:30:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:07,460 INFO L225 Difference]: With dead ends: 917 [2025-03-08 05:30:07,460 INFO L226 Difference]: Without dead ends: 592 [2025-03-08 05:30:07,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 169 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-03-08 05:30:07,464 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 0 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:07,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1742 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-08 05:30:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-03-08 05:30:07,509 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-03-08 05:30:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 874 transitions. [2025-03-08 05:30:07,513 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 874 transitions. Word has length 169 [2025-03-08 05:30:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:07,514 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 874 transitions. [2025-03-08 05:30:07,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:30:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 874 transitions. [2025-03-08 05:30:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 05:30:07,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:07,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:07,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:30:07,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:07,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:07,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:07,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1636458079, now seen corresponding path program 1 times [2025-03-08 05:30:07,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:07,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832324852] [2025-03-08 05:30:07,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:07,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:07,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 05:30:07,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 05:30:07,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:07,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-08 05:30:07,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:07,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832324852] [2025-03-08 05:30:07,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832324852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:07,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241965340] [2025-03-08 05:30:07,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:07,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:07,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:07,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:07,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:30:08,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 05:30:08,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 05:30:08,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:08,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:08,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:30:08,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-08 05:30:08,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:08,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241965340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:08,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:08,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-08 05:30:08,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312622094] [2025-03-08 05:30:08,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:08,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:08,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:08,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:08,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:08,450 INFO L87 Difference]: Start difference. First operand 592 states and 874 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-08 05:30:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:08,537 INFO L93 Difference]: Finished difference Result 1458 states and 2151 transitions. [2025-03-08 05:30:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 194 [2025-03-08 05:30:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:08,544 INFO L225 Difference]: With dead ends: 1458 [2025-03-08 05:30:08,545 INFO L226 Difference]: Without dead ends: 1141 [2025-03-08 05:30:08,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 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-03-08 05:30:08,546 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 769 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:08,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1729 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-08 05:30:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1139. [2025-03-08 05:30:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 851 states have (on average 1.5052878965922445) internal successors, (1281), 886 states have internal predecessors, (1281), 202 states have call successors, (202), 85 states have call predecessors, (202), 85 states have return successors, (210), 198 states have call predecessors, (210), 200 states have call successors, (210) [2025-03-08 05:30:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1693 transitions. [2025-03-08 05:30:08,596 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1693 transitions. Word has length 194 [2025-03-08 05:30:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:08,596 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1693 transitions. [2025-03-08 05:30:08,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-08 05:30:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1693 transitions. [2025-03-08 05:30:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 05:30:08,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:08,602 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] [2025-03-08 05:30:08,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:30:08,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 05:30:08,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:08,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1257912453, now seen corresponding path program 1 times [2025-03-08 05:30:08,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:08,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539250691] [2025-03-08 05:30:08,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:08,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:08,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 05:30:08,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 05:30:08,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:08,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-08 05:30:08,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:08,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539250691] [2025-03-08 05:30:08,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539250691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:08,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689730254] [2025-03-08 05:30:08,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:08,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:08,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:08,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:08,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:30:09,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 05:30:09,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 05:30:09,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:09,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:09,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:30:09,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 05:30:09,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:09,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689730254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:09,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:09,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-08 05:30:09,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340929574] [2025-03-08 05:30:09,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:09,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:30:09,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:09,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:30:09,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:30:09,365 INFO L87 Difference]: Start difference. First operand 1139 states and 1693 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), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:30:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:09,504 INFO L93 Difference]: Finished difference Result 2199 states and 3280 transitions. [2025-03-08 05:30:09,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:30:09,505 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), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 174 [2025-03-08 05:30:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:09,514 INFO L225 Difference]: With dead ends: 2199 [2025-03-08 05:30:09,514 INFO L226 Difference]: Without dead ends: 1149 [2025-03-08 05:30:09,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 170 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-03-08 05:30:09,522 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 4 mSDsluCounter, 4287 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5148 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-03-08 05:30:09,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5148 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:30:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-03-08 05:30:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1147. [2025-03-08 05:30:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 855 states have (on average 1.5029239766081872) internal successors, (1285), 892 states have internal predecessors, (1285), 202 states have call successors, (202), 85 states have call predecessors, (202), 89 states have return successors, (218), 200 states have call predecessors, (218), 200 states have call successors, (218) [2025-03-08 05:30:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1705 transitions. [2025-03-08 05:30:09,573 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1705 transitions. Word has length 174 [2025-03-08 05:30:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:09,574 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1705 transitions. [2025-03-08 05:30:09,574 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), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:30:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1705 transitions. [2025-03-08 05:30:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 05:30:09,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:09,579 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 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] [2025-03-08 05:30:09,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:30:09,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:09,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:09,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2053181523, now seen corresponding path program 1 times [2025-03-08 05:30:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587451835] [2025-03-08 05:30:09,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:09,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:09,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 05:30:09,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 05:30:09,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:09,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-08 05:30:09,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:09,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587451835] [2025-03-08 05:30:09,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587451835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:09,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:09,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:30:09,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101227470] [2025-03-08 05:30:09,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:09,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:30:09,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:09,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:30:09,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:30:09,966 INFO L87 Difference]: Start difference. First operand 1147 states and 1705 transitions. Second operand has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 05:30:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:10,071 INFO L93 Difference]: Finished difference Result 2171 states and 3240 transitions. [2025-03-08 05:30:10,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:30:10,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 188 [2025-03-08 05:30:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:10,081 INFO L225 Difference]: With dead ends: 2171 [2025-03-08 05:30:10,081 INFO L226 Difference]: Without dead ends: 1153 [2025-03-08 05:30:10,084 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-03-08 05:30:10,085 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 4 mSDsluCounter, 4287 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5148 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:10,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5148 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-03-08 05:30:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1151. [2025-03-08 05:30:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 857 states have (on average 1.5017502917152858) internal successors, (1287), 894 states have internal predecessors, (1287), 202 states have call successors, (202), 85 states have call predecessors, (202), 91 states have return successors, (220), 202 states have call predecessors, (220), 200 states have call successors, (220) [2025-03-08 05:30:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1709 transitions. [2025-03-08 05:30:10,151 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1709 transitions. Word has length 188 [2025-03-08 05:30:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:10,152 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1709 transitions. [2025-03-08 05:30:10,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 05:30:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1709 transitions. [2025-03-08 05:30:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 05:30:10,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:10,156 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] [2025-03-08 05:30:10,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:30:10,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:10,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash -893913483, now seen corresponding path program 1 times [2025-03-08 05:30:10,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:10,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253158448] [2025-03-08 05:30:10,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:10,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 05:30:10,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 05:30:10,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:10,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-08 05:30:10,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:10,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253158448] [2025-03-08 05:30:10,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253158448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:10,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:10,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:30:10,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768789534] [2025-03-08 05:30:10,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:10,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:30:10,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:10,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:30:10,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:30:10,368 INFO L87 Difference]: Start difference. First operand 1151 states and 1709 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-03-08 05:30:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:10,468 INFO L93 Difference]: Finished difference Result 2179 states and 3252 transitions. [2025-03-08 05:30:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:30:10,469 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-03-08 05:30:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:10,475 INFO L225 Difference]: With dead ends: 2179 [2025-03-08 05:30:10,475 INFO L226 Difference]: Without dead ends: 1161 [2025-03-08 05:30:10,478 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-03-08 05:30:10,479 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 2 mSDsluCounter, 4307 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5173 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:10,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5173 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:10,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-03-08 05:30:10,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1155. [2025-03-08 05:30:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 859 states have (on average 1.5005820721769498) internal successors, (1289), 898 states have internal predecessors, (1289), 202 states have call successors, (202), 85 states have call predecessors, (202), 93 states have return successors, (226), 202 states have call predecessors, (226), 200 states have call successors, (226) [2025-03-08 05:30:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1717 transitions. [2025-03-08 05:30:10,519 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1717 transitions. Word has length 176 [2025-03-08 05:30:10,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:10,519 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1717 transitions. [2025-03-08 05:30:10,519 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-03-08 05:30:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1717 transitions. [2025-03-08 05:30:10,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 05:30:10,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:10,524 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 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] [2025-03-08 05:30:10,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:30:10,524 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:10,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash 464897008, now seen corresponding path program 1 times [2025-03-08 05:30:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:10,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559129516] [2025-03-08 05:30:10,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:10,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:10,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 05:30:10,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 05:30:10,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:10,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:30:10,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:10,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559129516] [2025-03-08 05:30:10,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559129516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:10,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802976272] [2025-03-08 05:30:10,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:10,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:10,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:10,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:10,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:30:10,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 05:30:10,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 05:30:10,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:10,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:10,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:30:10,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-08 05:30:11,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:11,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802976272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:11,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:11,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 05:30:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630180848] [2025-03-08 05:30:11,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:11,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:11,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:11,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:11,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:11,108 INFO L87 Difference]: Start difference. First operand 1155 states and 1717 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-08 05:30:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:11,189 INFO L93 Difference]: Finished difference Result 2827 states and 4245 transitions. [2025-03-08 05:30:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:11,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 190 [2025-03-08 05:30:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:11,202 INFO L225 Difference]: With dead ends: 2827 [2025-03-08 05:30:11,203 INFO L226 Difference]: Without dead ends: 2211 [2025-03-08 05:30:11,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 190 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-03-08 05:30:11,207 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 737 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1747 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-03-08 05:30:11,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1747 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2025-03-08 05:30:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2209. [2025-03-08 05:30:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 1647 states have (on average 1.50394656952034) internal successors, (2477), 1717 states have internal predecessors, (2477), 376 states have call successors, (376), 169 states have call predecessors, (376), 185 states have return successors, (458), 378 states have call predecessors, (458), 372 states have call successors, (458) [2025-03-08 05:30:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3311 transitions. [2025-03-08 05:30:11,307 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3311 transitions. Word has length 190 [2025-03-08 05:30:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:11,307 INFO L471 AbstractCegarLoop]: Abstraction has 2209 states and 3311 transitions. [2025-03-08 05:30:11,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-08 05:30:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3311 transitions. [2025-03-08 05:30:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 05:30:11,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:11,316 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] [2025-03-08 05:30:11,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:30:11,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:11,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:11,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash 409012696, now seen corresponding path program 1 times [2025-03-08 05:30:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426671899] [2025-03-08 05:30:11,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:11,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 05:30:11,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 05:30:11,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:11,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:30:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426671899] [2025-03-08 05:30:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426671899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639912660] [2025-03-08 05:30:11,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:11,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:11,624 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:11,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:30:11,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 05:30:11,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 05:30:11,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:11,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:11,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:30:11,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:30:11,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:30:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:30:12,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639912660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:30:12,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:30:12,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:30:12,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988504671] [2025-03-08 05:30:12,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:30:12,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:30:12,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:12,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:30:12,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:30:12,061 INFO L87 Difference]: Start difference. First operand 2209 states and 3311 transitions. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 05:30:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:12,245 INFO L93 Difference]: Finished difference Result 4908 states and 7589 transitions. [2025-03-08 05:30:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:30:12,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 177 [2025-03-08 05:30:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:12,265 INFO L225 Difference]: With dead ends: 4908 [2025-03-08 05:30:12,265 INFO L226 Difference]: Without dead ends: 3709 [2025-03-08 05:30:12,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:30:12,272 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 514 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 3922 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:12,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 3922 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:30:12,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2025-03-08 05:30:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3613. [2025-03-08 05:30:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3613 states, 2847 states have (on average 1.5823674042852125) internal successors, (4505), 2941 states have internal predecessors, (4505), 580 states have call successors, (580), 169 states have call predecessors, (580), 185 states have return successors, (662), 582 states have call predecessors, (662), 576 states have call successors, (662) [2025-03-08 05:30:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 5747 transitions. [2025-03-08 05:30:12,404 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 5747 transitions. Word has length 177 [2025-03-08 05:30:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:12,404 INFO L471 AbstractCegarLoop]: Abstraction has 3613 states and 5747 transitions. [2025-03-08 05:30:12,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 05:30:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 5747 transitions. [2025-03-08 05:30:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 05:30:12,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:12,420 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, 1, 1] [2025-03-08 05:30:12,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:30:12,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:12,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:12,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:12,626 INFO L85 PathProgramCache]: Analyzing trace with hash -432356538, now seen corresponding path program 1 times [2025-03-08 05:30:12,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:12,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710303299] [2025-03-08 05:30:12,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:12,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:12,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 05:30:12,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:30:12,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:12,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:30:12,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:12,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710303299] [2025-03-08 05:30:12,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710303299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:12,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:12,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:12,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433269282] [2025-03-08 05:30:12,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:12,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:12,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:12,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:12,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:12,693 INFO L87 Difference]: Start difference. First operand 3613 states and 5747 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (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-03-08 05:30:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:12,814 INFO L93 Difference]: Finished difference Result 7948 states and 12799 transitions. [2025-03-08 05:30:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:12,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (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 183 [2025-03-08 05:30:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:12,839 INFO L225 Difference]: With dead ends: 7948 [2025-03-08 05:30:12,839 INFO L226 Difference]: Without dead ends: 4705 [2025-03-08 05:30:12,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:12,850 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 173 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:12,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1709 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4705 states. [2025-03-08 05:30:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4705 to 4673. [2025-03-08 05:30:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4673 states, 3739 states have (on average 1.5974859588125168) internal successors, (5973), 3857 states have internal predecessors, (5973), 748 states have call successors, (748), 169 states have call predecessors, (748), 185 states have return successors, (830), 750 states have call predecessors, (830), 744 states have call successors, (830) [2025-03-08 05:30:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4673 states to 4673 states and 7551 transitions. [2025-03-08 05:30:13,008 INFO L78 Accepts]: Start accepts. Automaton has 4673 states and 7551 transitions. Word has length 183 [2025-03-08 05:30:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:13,009 INFO L471 AbstractCegarLoop]: Abstraction has 4673 states and 7551 transitions. [2025-03-08 05:30:13,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (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-03-08 05:30:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 4673 states and 7551 transitions. [2025-03-08 05:30:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 05:30:13,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:13,029 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, 1, 1, 1] [2025-03-08 05:30:13,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:30:13,029 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:13,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2117785743, now seen corresponding path program 1 times [2025-03-08 05:30:13,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:13,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879191649] [2025-03-08 05:30:13,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:13,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:13,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 05:30:13,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 05:30:13,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:13,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:30:13,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:13,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879191649] [2025-03-08 05:30:13,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879191649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:13,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:13,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566170213] [2025-03-08 05:30:13,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:13,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:13,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:13,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:13,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:13,096 INFO L87 Difference]: Start difference. First operand 4673 states and 7551 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-03-08 05:30:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:13,282 INFO L93 Difference]: Finished difference Result 10884 states and 17847 transitions. [2025-03-08 05:30:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 184 [2025-03-08 05:30:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:13,323 INFO L225 Difference]: With dead ends: 10884 [2025-03-08 05:30:13,324 INFO L226 Difference]: Without dead ends: 6661 [2025-03-08 05:30:13,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:13,342 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 171 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:13,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1750 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2025-03-08 05:30:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 6629. [2025-03-08 05:30:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6629 states, 5379 states have (on average 1.6175869120654396) internal successors, (8701), 5537 states have internal predecessors, (8701), 1064 states have call successors, (1064), 169 states have call predecessors, (1064), 185 states have return successors, (1146), 1066 states have call predecessors, (1146), 1060 states have call successors, (1146) [2025-03-08 05:30:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6629 states to 6629 states and 10911 transitions. [2025-03-08 05:30:13,595 INFO L78 Accepts]: Start accepts. Automaton has 6629 states and 10911 transitions. Word has length 184 [2025-03-08 05:30:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:13,595 INFO L471 AbstractCegarLoop]: Abstraction has 6629 states and 10911 transitions. [2025-03-08 05:30:13,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-03-08 05:30:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6629 states and 10911 transitions. [2025-03-08 05:30:13,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 05:30:13,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:13,620 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, 1, 1, 1, 1] [2025-03-08 05:30:13,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:30:13,621 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:13,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash 695402119, now seen corresponding path program 1 times [2025-03-08 05:30:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:13,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319695845] [2025-03-08 05:30:13,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:13,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 05:30:13,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 05:30:13,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:13,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:30:13,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:13,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319695845] [2025-03-08 05:30:13,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319695845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:13,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:13,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:13,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258965825] [2025-03-08 05:30:13,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:13,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:13,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:13,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:13,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:13,680 INFO L87 Difference]: Start difference. First operand 6629 states and 10911 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (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-03-08 05:30:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:13,887 INFO L93 Difference]: Finished difference Result 15760 states and 26235 transitions. [2025-03-08 05:30:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:13,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (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 185 [2025-03-08 05:30:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:13,935 INFO L225 Difference]: With dead ends: 15760 [2025-03-08 05:30:13,935 INFO L226 Difference]: Without dead ends: 9817 [2025-03-08 05:30:13,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:13,959 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 169 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:13,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1755 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9817 states. [2025-03-08 05:30:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9817 to 9785. [2025-03-08 05:30:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9785 states, 8059 states have (on average 1.6320883484303264) internal successors, (13153), 8281 states have internal predecessors, (13153), 1540 states have call successors, (1540), 169 states have call predecessors, (1540), 185 states have return successors, (1622), 1542 states have call predecessors, (1622), 1536 states have call successors, (1622) [2025-03-08 05:30:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9785 states to 9785 states and 16315 transitions. [2025-03-08 05:30:14,311 INFO L78 Accepts]: Start accepts. Automaton has 9785 states and 16315 transitions. Word has length 185 [2025-03-08 05:30:14,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:14,312 INFO L471 AbstractCegarLoop]: Abstraction has 9785 states and 16315 transitions. [2025-03-08 05:30:14,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (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-03-08 05:30:14,312 INFO L276 IsEmpty]: Start isEmpty. Operand 9785 states and 16315 transitions. [2025-03-08 05:30:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 05:30:14,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:14,350 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, 1, 1, 1, 1, 1] [2025-03-08 05:30:14,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:30:14,351 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:14,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash 185036752, now seen corresponding path program 1 times [2025-03-08 05:30:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:14,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291662374] [2025-03-08 05:30:14,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:14,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:14,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 05:30:14,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 05:30:14,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:14,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:30:14,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:14,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291662374] [2025-03-08 05:30:14,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291662374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:14,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:14,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:14,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736853970] [2025-03-08 05:30:14,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:14,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:14,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:14,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:14,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:14,410 INFO L87 Difference]: Start difference. First operand 9785 states and 16315 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-03-08 05:30:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:14,669 INFO L93 Difference]: Finished difference Result 23172 states and 38979 transitions. [2025-03-08 05:30:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:14,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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 186 [2025-03-08 05:30:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:14,722 INFO L225 Difference]: With dead ends: 23172 [2025-03-08 05:30:14,722 INFO L226 Difference]: Without dead ends: 14673 [2025-03-08 05:30:14,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:14,747 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 167 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:14,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1734 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14673 states. [2025-03-08 05:30:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14673 to 14641. [2025-03-08 05:30:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14641 states, 12267 states have (on average 1.6435151218716884) internal successors, (20161), 12593 states have internal predecessors, (20161), 2188 states have call successors, (2188), 169 states have call predecessors, (2188), 185 states have return successors, (2270), 2190 states have call predecessors, (2270), 2184 states have call successors, (2270) [2025-03-08 05:30:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14641 states to 14641 states and 24619 transitions. [2025-03-08 05:30:15,335 INFO L78 Accepts]: Start accepts. Automaton has 14641 states and 24619 transitions. Word has length 186 [2025-03-08 05:30:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:15,336 INFO L471 AbstractCegarLoop]: Abstraction has 14641 states and 24619 transitions. [2025-03-08 05:30:15,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-03-08 05:30:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 14641 states and 24619 transitions. [2025-03-08 05:30:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 05:30:15,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:15,391 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, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:15,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:30:15,391 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:15,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash -470796536, now seen corresponding path program 1 times [2025-03-08 05:30:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:15,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017605868] [2025-03-08 05:30:15,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:15,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 05:30:15,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 05:30:15,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:15,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:30:15,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:15,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017605868] [2025-03-08 05:30:15,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017605868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:15,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:15,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:15,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547624954] [2025-03-08 05:30:15,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:15,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:15,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:15,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:15,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:15,481 INFO L87 Difference]: Start difference. First operand 14641 states and 24619 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (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-03-08 05:30:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:15,897 INFO L93 Difference]: Finished difference Result 34872 states and 59099 transitions. [2025-03-08 05:30:15,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:15,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (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 187 [2025-03-08 05:30:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:15,981 INFO L225 Difference]: With dead ends: 34872 [2025-03-08 05:30:15,981 INFO L226 Difference]: Without dead ends: 22509 [2025-03-08 05:30:16,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:16,017 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 165 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:16,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1733 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22509 states. [2025-03-08 05:30:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22509 to 22477. [2025-03-08 05:30:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22477 states, 19123 states have (on average 1.6520943366626575) internal successors, (31593), 19625 states have internal predecessors, (31593), 3168 states have call successors, (3168), 169 states have call predecessors, (3168), 185 states have return successors, (3250), 3170 states have call predecessors, (3250), 3164 states have call successors, (3250) [2025-03-08 05:30:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22477 states to 22477 states and 38011 transitions. [2025-03-08 05:30:16,863 INFO L78 Accepts]: Start accepts. Automaton has 22477 states and 38011 transitions. Word has length 187 [2025-03-08 05:30:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:16,863 INFO L471 AbstractCegarLoop]: Abstraction has 22477 states and 38011 transitions. [2025-03-08 05:30:16,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (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-03-08 05:30:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 22477 states and 38011 transitions. [2025-03-08 05:30:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 05:30:16,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:16,923 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:16,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:30:16,923 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:16,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:16,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1287159089, now seen corresponding path program 1 times [2025-03-08 05:30:16,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:16,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334795918] [2025-03-08 05:30:16,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:16,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:16,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 05:30:16,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 05:30:16,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:16,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:30:16,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:16,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334795918] [2025-03-08 05:30:16,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334795918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:16,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:16,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:16,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483097951] [2025-03-08 05:30:16,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:16,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:16,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:16,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:16,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:16,989 INFO L87 Difference]: Start difference. First operand 22477 states and 38011 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-03-08 05:30:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:17,499 INFO L93 Difference]: Finished difference Result 54312 states and 92547 transitions. [2025-03-08 05:30:17,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:17,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 188 [2025-03-08 05:30:17,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:17,620 INFO L225 Difference]: With dead ends: 54312 [2025-03-08 05:30:17,620 INFO L226 Difference]: Without dead ends: 35633 [2025-03-08 05:30:17,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:17,655 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 163 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:17,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1740 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35633 states. [2025-03-08 05:30:18,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35633 to 35601. [2025-03-08 05:30:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35601 states, 30275 states have (on average 1.654467382328654) internal successors, (50089), 31089 states have internal predecessors, (50089), 5140 states have call successors, (5140), 169 states have call predecessors, (5140), 185 states have return successors, (5222), 5142 states have call predecessors, (5222), 5136 states have call successors, (5222) [2025-03-08 05:30:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35601 states to 35601 states and 60451 transitions. [2025-03-08 05:30:18,854 INFO L78 Accepts]: Start accepts. Automaton has 35601 states and 60451 transitions. Word has length 188 [2025-03-08 05:30:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:18,855 INFO L471 AbstractCegarLoop]: Abstraction has 35601 states and 60451 transitions. [2025-03-08 05:30:18,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-03-08 05:30:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 35601 states and 60451 transitions. [2025-03-08 05:30:18,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 05:30:18,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:18,987 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:18,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:30:18,987 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:18,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:18,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1822768137, now seen corresponding path program 1 times [2025-03-08 05:30:18,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:18,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938243515] [2025-03-08 05:30:18,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:18,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:19,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 05:30:19,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 05:30:19,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:19,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:30:19,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:19,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938243515] [2025-03-08 05:30:19,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938243515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:19,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:19,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:19,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415793278] [2025-03-08 05:30:19,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:19,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:19,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:19,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:19,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:19,068 INFO L87 Difference]: Start difference. First operand 35601 states and 60451 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-03-08 05:30:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:20,141 INFO L93 Difference]: Finished difference Result 89172 states and 152503 transitions. [2025-03-08 05:30:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:20,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 189 [2025-03-08 05:30:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:20,364 INFO L225 Difference]: With dead ends: 89172 [2025-03-08 05:30:20,364 INFO L226 Difference]: Without dead ends: 59265 [2025-03-08 05:30:20,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:20,421 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 161 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:20,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1738 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59265 states. [2025-03-08 05:30:21,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59265 to 59233. [2025-03-08 05:30:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59233 states, 50619 states have (on average 1.6578952567217844) internal successors, (83921), 52009 states have internal predecessors, (83921), 8428 states have call successors, (8428), 169 states have call predecessors, (8428), 185 states have return successors, (8510), 8430 states have call predecessors, (8510), 8424 states have call successors, (8510) [2025-03-08 05:30:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59233 states to 59233 states and 100859 transitions. [2025-03-08 05:30:21,943 INFO L78 Accepts]: Start accepts. Automaton has 59233 states and 100859 transitions. Word has length 189 [2025-03-08 05:30:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:21,944 INFO L471 AbstractCegarLoop]: Abstraction has 59233 states and 100859 transitions. [2025-03-08 05:30:21,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-03-08 05:30:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 59233 states and 100859 transitions. [2025-03-08 05:30:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 05:30:22,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:22,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:22,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:30:22,505 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:22,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1984872082, now seen corresponding path program 1 times [2025-03-08 05:30:22,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:22,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573652172] [2025-03-08 05:30:22,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:22,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:22,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 05:30:22,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 05:30:22,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:22,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:30:22,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:22,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573652172] [2025-03-08 05:30:22,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573652172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:22,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:22,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568965307] [2025-03-08 05:30:22,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:22,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:22,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:22,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:22,581 INFO L87 Difference]: Start difference. First operand 59233 states and 100859 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-03-08 05:30:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:24,343 INFO L93 Difference]: Finished difference Result 142648 states and 242791 transitions. [2025-03-08 05:30:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:24,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 190 [2025-03-08 05:30:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:24,781 INFO L225 Difference]: With dead ends: 142648 [2025-03-08 05:30:24,781 INFO L226 Difference]: Without dead ends: 93529 [2025-03-08 05:30:24,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:24,942 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 159 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:24,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1727 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93529 states. [2025-03-08 05:30:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93529 to 93497. [2025-03-08 05:30:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93497 states, 80071 states have (on average 1.6418553533738807) internal successors, (131465), 82557 states have internal predecessors, (131465), 13240 states have call successors, (13240), 169 states have call predecessors, (13240), 185 states have return successors, (13322), 13242 states have call predecessors, (13322), 13236 states have call successors, (13322) [2025-03-08 05:30:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93497 states to 93497 states and 158027 transitions. [2025-03-08 05:30:28,181 INFO L78 Accepts]: Start accepts. Automaton has 93497 states and 158027 transitions. Word has length 190 [2025-03-08 05:30:28,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:28,181 INFO L471 AbstractCegarLoop]: Abstraction has 93497 states and 158027 transitions. [2025-03-08 05:30:28,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-03-08 05:30:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 93497 states and 158027 transitions. [2025-03-08 05:30:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 05:30:28,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:28,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:28,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:30:28,955 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:28,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:28,955 INFO L85 PathProgramCache]: Analyzing trace with hash 451195658, now seen corresponding path program 1 times [2025-03-08 05:30:28,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:28,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081954757] [2025-03-08 05:30:28,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:28,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:28,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 05:30:28,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 05:30:28,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:28,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:30:29,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:29,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081954757] [2025-03-08 05:30:29,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081954757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:29,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:29,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:29,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137315452] [2025-03-08 05:30:29,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:29,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:29,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:29,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:29,025 INFO L87 Difference]: Start difference. First operand 93497 states and 158027 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (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-03-08 05:30:32,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:32,017 INFO L93 Difference]: Finished difference Result 246720 states and 418091 transitions. [2025-03-08 05:30:32,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:32,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (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 191 [2025-03-08 05:30:32,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:32,593 INFO L225 Difference]: With dead ends: 246720 [2025-03-08 05:30:32,593 INFO L226 Difference]: Without dead ends: 166437 [2025-03-08 05:30:32,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:32,738 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 157 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:32,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1760 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166437 states. [2025-03-08 05:30:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166437 to 166405. [2025-03-08 05:30:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166405 states, 143179 states have (on average 1.6375096906669273) internal successors, (234457), 146729 states have internal predecessors, (234457), 23040 states have call successors, (23040), 169 states have call predecessors, (23040), 185 states have return successors, (23122), 23042 states have call predecessors, (23122), 23036 states have call successors, (23122) [2025-03-08 05:30:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166405 states to 166405 states and 280619 transitions. [2025-03-08 05:30:37,673 INFO L78 Accepts]: Start accepts. Automaton has 166405 states and 280619 transitions. Word has length 191 [2025-03-08 05:30:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:37,674 INFO L471 AbstractCegarLoop]: Abstraction has 166405 states and 280619 transitions. [2025-03-08 05:30:37,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (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-03-08 05:30:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 166405 states and 280619 transitions. [2025-03-08 05:30:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 05:30:38,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:38,613 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 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] [2025-03-08 05:30:38,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:30:38,613 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:38,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:38,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1118576650, now seen corresponding path program 2 times [2025-03-08 05:30:38,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:38,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217019048] [2025-03-08 05:30:38,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:30:38,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:38,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-03-08 05:30:38,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 89 of 192 statements. [2025-03-08 05:30:38,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:30:38,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-03-08 05:30:38,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:38,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217019048] [2025-03-08 05:30:38,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217019048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:38,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:38,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:38,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107023219] [2025-03-08 05:30:38,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:38,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:38,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:38,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:38,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:38,683 INFO L87 Difference]: Start difference. First operand 166405 states and 280619 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23)