./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_spec11_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 1c5af94617941f44648ac9498189d5e73562b4cbf6ae0ea00b10262137b50bb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:20:59,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:20:59,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:20:59,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:20:59,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:20:59,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:20:59,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:20:59,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:20:59,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:20:59,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:20:59,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:20:59,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:20:59,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:20:59,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:20:59,708 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:20:59,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:20:59,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:20:59,708 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:20:59,709 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:20:59,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:20:59,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:20:59,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:20:59,710 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:20:59,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:20:59,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:20:59,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:20:59,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:20:59,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:20:59,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:20:59,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:20:59,710 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 -> 1c5af94617941f44648ac9498189d5e73562b4cbf6ae0ea00b10262137b50bb0 [2025-03-03 14:20:59,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:20:59,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:20:59,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:20:59,947 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:20:59,948 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:20:59,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c [2025-03-03 14:21:01,067 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77cfb1ade/48208ae13088429d9943f47ed702c1ff/FLAG716b258f5 [2025-03-03 14:21:01,431 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:21:01,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c [2025-03-03 14:21:01,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77cfb1ade/48208ae13088429d9943f47ed702c1ff/FLAG716b258f5 [2025-03-03 14:21:01,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77cfb1ade/48208ae13088429d9943f47ed702c1ff [2025-03-03 14:21:01,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:21:01,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:21:01,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:21:01,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:21:01,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:21:01,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:21:01" (1/1) ... [2025-03-03 14:21:01,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113a4dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:01, skipping insertion in model container [2025-03-03 14:21:01,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:21:01" (1/1) ... [2025-03-03 14:21:01,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:21:02,015 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_spec11_productSimulator.cil.c[48047,48060] [2025-03-03 14:21:02,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:21:02,063 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:21:02,068 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-03-03 14:21:02,069 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [168] [2025-03-03 14:21:02,069 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [754] [2025-03-03 14:21:02,070 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1126] [2025-03-03 14:21:02,070 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1492] [2025-03-03 14:21:02,070 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1698] [2025-03-03 14:21:02,070 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2095] [2025-03-03 14:21:02,070 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2112] [2025-03-03 14:21:02,070 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2378] [2025-03-03 14:21:02,070 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [2387] [2025-03-03 14:21:02,070 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [3447] [2025-03-03 14:21:02,138 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_spec11_productSimulator.cil.c[48047,48060] [2025-03-03 14:21:02,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:21:02,181 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:21:02,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02 WrapperNode [2025-03-03 14:21:02,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:21:02,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:21:02,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:21:02,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:21:02,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (1/1) ... [2025-03-03 14:21:02,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (1/1) ... [2025-03-03 14:21:02,250 INFO L138 Inliner]: procedures = 151, calls = 262, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1308 [2025-03-03 14:21:02,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:21:02,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:21:02,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:21:02,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:21:02,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (1/1) ... [2025-03-03 14:21:02,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (1/1) ... [2025-03-03 14:21:02,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (1/1) ... [2025-03-03 14:21:02,300 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-03 14:21:02,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (1/1) ... [2025-03-03 14:21:02,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (1/1) ... [2025-03-03 14:21:02,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (1/1) ... [2025-03-03 14:21:02,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (1/1) ... [2025-03-03 14:21:02,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (1/1) ... [2025-03-03 14:21:02,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (1/1) ... [2025-03-03 14:21:02,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:21:02,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:21:02,347 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:21:02,347 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:21:02,348 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (1/1) ... [2025-03-03 14:21:02,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:21:02,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:02,379 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-03 14:21:02,382 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-03 14:21:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:21:02,401 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:21:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-03-03 14:21:02,401 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-03-03 14:21:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-03-03 14:21:02,402 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-03-03 14:21:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:21:02,402 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:21:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:21:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:21:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:21:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:21:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:21:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:21:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-03-03 14:21:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-03-03 14:21:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:21:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:21:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-03-03 14:21:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-03-03 14:21:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:21:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:21:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:21:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:21:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:21:02,404 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:21:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-03-03 14:21:02,404 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-03-03 14:21:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-03-03 14:21:02,404 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-03-03 14:21:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:21:02,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:21:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:21:02,404 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:21:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:21:02,404 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:21:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-03-03 14:21:02,404 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:21:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-03-03 14:21:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-03-03 14:21:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-03-03 14:21:02,406 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-03-03 14:21:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:21:02,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:21:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:21:02,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:21:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:21:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:21:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:21:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:21:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:21:02,406 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:21:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-03-03 14:21:02,406 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-03-03 14:21:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-03-03 14:21:02,406 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-03-03 14:21:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:21:02,406 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:21:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:21:02,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:21:02,598 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:21:02,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:21:02,627 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1633: #res := ~retValue_acc~11; [2025-03-03 14:21:02,639 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2002: #res := ~retValue_acc~24; [2025-03-03 14:21:02,676 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L632: #res := ~retValue_acc~6; [2025-03-03 14:21:02,692 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2989: #res := ~retValue_acc~37; [2025-03-03 14:21:02,741 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2533: #res := ~retValue_acc~31; [2025-03-03 14:21:02,780 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1739-1: getEmailId_#res#1 := getEmailId_~retValue_acc~17#1; [2025-03-03 14:21:02,804 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965: #res := ~retValue_acc~23; [2025-03-03 14:21:02,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813: #res := ~retValue_acc~19; [2025-03-03 14:21:02,873 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~12#1; [2025-03-03 14:21:02,873 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1671: #res#1 := ~retValue_acc~13#1; [2025-03-03 14:21:02,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~38#1; [2025-03-03 14:21:02,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081: #res#1 := ~retValue_acc~39#1; [2025-03-03 14:21:02,988 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3305: #res := ~retValue_acc~42; [2025-03-03 14:21:02,994 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1695-1: createEmail_#res#1 := createEmail_~retValue_acc~15#1; [2025-03-03 14:21:03,000 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928: #res := ~retValue_acc~22; [2025-03-03 14:21:03,025 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3424-1: getClientId_#res#1 := getClientId_~retValue_acc~44#1; [2025-03-03 14:21:03,055 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2076-1: isVerified_#res#1 := isVerified_~retValue_acc~26#1; [2025-03-03 14:21:03,055 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3377-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~43#1; [2025-03-03 14:21:03,059 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2039: #res := ~retValue_acc~25; [2025-03-03 14:21:03,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: #res := ~retValue_acc~0; [2025-03-03 14:21:03,094 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2859: #res := ~retValue_acc~35; [2025-03-03 14:21:03,114 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2942-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~36#1; [2025-03-03 14:21:03,359 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L598-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~4#1; [2025-03-03 14:21:03,360 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3144-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~40#1; [2025-03-03 14:21:03,360 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L589-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~3#1; [2025-03-03 14:21:03,360 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L607-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~5#1; [2025-03-03 14:21:03,360 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3251-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~41#1; [2025-03-03 14:21:03,360 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L165-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-03 14:21:03,364 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1776: #res := ~retValue_acc~18; [2025-03-03 14:21:03,504 INFO L? ?]: Removed 626 outVars from TransFormulas that were not future-live. [2025-03-03 14:21:03,505 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:21:03,520 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:21:03,524 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:21:03,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:21:03 BoogieIcfgContainer [2025-03-03 14:21:03,524 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:21:03,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:21:03,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:21:03,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:21:03,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:21:01" (1/3) ... [2025-03-03 14:21:03,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd394c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:21:03, skipping insertion in model container [2025-03-03 14:21:03,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:02" (2/3) ... [2025-03-03 14:21:03,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd394c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:21:03, skipping insertion in model container [2025-03-03 14:21:03,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:21:03" (3/3) ... [2025-03-03 14:21:03,531 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_productSimulator.cil.c [2025-03-03 14:21:03,541 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:21:03,544 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_productSimulator.cil.c that has 44 procedures, 599 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:21:03,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:21:03,604 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;@21445290, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:21:03,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:21:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-03 14:21:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 14:21:03,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:03,652 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:03,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:03,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash 989823204, now seen corresponding path program 1 times [2025-03-03 14:21:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:03,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459500318] [2025-03-03 14:21:03,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:03,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:03,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 14:21:03,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 14:21:03,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:03,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:21:03,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:03,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459500318] [2025-03-03 14:21:03,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459500318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:03,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:03,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:21:03,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5655713] [2025-03-03 14:21:03,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:03,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:21:03,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:03,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:21:03,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:21:03,963 INFO L87 Difference]: Start difference. First operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:04,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:04,039 INFO L93 Difference]: Finished difference Result 930 states and 1371 transitions. [2025-03-03 14:21:04,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:21:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 156 [2025-03-03 14:21:04,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:04,057 INFO L225 Difference]: With dead ends: 930 [2025-03-03 14:21:04,057 INFO L226 Difference]: Without dead ends: 592 [2025-03-03 14:21:04,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:21:04,068 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:04,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:04,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-03 14:21:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-03-03 14:21:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 439 states have (on average 1.5125284738041003) internal successors, (664), 458 states have internal predecessors, (664), 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-03 14:21:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 881 transitions. [2025-03-03 14:21:04,145 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 881 transitions. Word has length 156 [2025-03-03 14:21:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:04,146 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 881 transitions. [2025-03-03 14:21:04,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 881 transitions. [2025-03-03 14:21:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 14:21:04,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:04,153 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:04,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:21:04,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:04,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:04,154 INFO L85 PathProgramCache]: Analyzing trace with hash -184500897, now seen corresponding path program 1 times [2025-03-03 14:21:04,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:04,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219698462] [2025-03-03 14:21:04,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:04,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:04,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 14:21:04,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 14:21:04,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:04,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:21:04,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:04,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219698462] [2025-03-03 14:21:04,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219698462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:04,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:04,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:21:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423685248] [2025-03-03 14:21:04,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:04,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:04,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:04,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:04,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:04,487 INFO L87 Difference]: Start difference. First operand 592 states and 881 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:04,598 INFO L93 Difference]: Finished difference Result 1148 states and 1706 transitions. [2025-03-03 14:21:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:04,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2025-03-03 14:21:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:04,607 INFO L225 Difference]: With dead ends: 1148 [2025-03-03 14:21:04,607 INFO L226 Difference]: Without dead ends: 592 [2025-03-03 14:21:04,609 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-03 14:21:04,610 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 0 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:04,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3504 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-03 14:21:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-03-03 14:21:04,648 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-03 14:21:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 874 transitions. [2025-03-03 14:21:04,657 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 874 transitions. Word has length 157 [2025-03-03 14:21:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:04,657 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 874 transitions. [2025-03-03 14:21:04,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 874 transitions. [2025-03-03 14:21:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 14:21:04,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:04,661 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:04,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:21:04,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:04,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1253206751, now seen corresponding path program 1 times [2025-03-03 14:21:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:04,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874740646] [2025-03-03 14:21:04,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:04,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 14:21:04,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 14:21:04,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:04,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-03 14:21:05,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:05,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874740646] [2025-03-03 14:21:05,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874740646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:05,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163622500] [2025-03-03 14:21:05,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:05,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:05,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:05,026 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-03 14:21:05,028 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-03 14:21:05,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 14:21:05,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 14:21:05,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:05,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:05,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:21:05,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:21:05,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:05,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163622500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:05,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:05,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-03 14:21:05,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684274914] [2025-03-03 14:21:05,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:05,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:05,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:05,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:05,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:21:05,441 INFO L87 Difference]: Start difference. First operand 592 states and 874 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:05,473 INFO L93 Difference]: Finished difference Result 919 states and 1331 transitions. [2025-03-03 14:21:05,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:05,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 162 [2025-03-03 14:21:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:05,480 INFO L225 Difference]: With dead ends: 919 [2025-03-03 14:21:05,480 INFO L226 Difference]: Without dead ends: 594 [2025-03-03 14:21:05,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 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-03 14:21:05,484 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 0 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1744 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-03 14:21:05,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1744 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-03 14:21:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-03-03 14:21:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 441 states have (on average 1.4943310657596371) internal successors, (659), 460 states have internal predecessors, (659), 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-03 14:21:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 876 transitions. [2025-03-03 14:21:05,518 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 876 transitions. Word has length 162 [2025-03-03 14:21:05,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:05,519 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 876 transitions. [2025-03-03 14:21:05,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:05,520 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 876 transitions. [2025-03-03 14:21:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 14:21:05,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:05,525 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:05,534 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-03 14:21:05,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:05,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:05,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash -761229225, now seen corresponding path program 1 times [2025-03-03 14:21:05,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:05,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517136462] [2025-03-03 14:21:05,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:05,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:05,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:21:05,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:21:05,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:05,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 14:21:05,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:05,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517136462] [2025-03-03 14:21:05,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517136462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:05,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500195460] [2025-03-03 14:21:05,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:05,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:05,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:05,972 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-03 14:21:05,974 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-03 14:21:06,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:21:06,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:21:06,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:06,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:06,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:21:06,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-03 14:21:06,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500195460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:06,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:06,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-03 14:21:06,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248872980] [2025-03-03 14:21:06,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:06,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:21:06,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:06,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:21:06,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:21:06,415 INFO L87 Difference]: Start difference. First operand 594 states and 876 transitions. Second operand has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-03 14:21:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:06,527 INFO L93 Difference]: Finished difference Result 1135 states and 1681 transitions. [2025-03-03 14:21:06,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:21:06,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 168 [2025-03-03 14:21:06,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:06,532 INFO L225 Difference]: With dead ends: 1135 [2025-03-03 14:21:06,534 INFO L226 Difference]: Without dead ends: 599 [2025-03-03 14:21:06,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 164 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-03 14:21:06,537 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 4 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5154 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:06,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5154 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:21:06,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-03 14:21:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2025-03-03 14:21:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 443 states have (on average 1.492099322799097) internal successors, (661), 463 states have internal predecessors, (661), 109 states have call successors, (109), 43 states have call predecessors, (109), 45 states have return successors, (112), 108 states have call predecessors, (112), 108 states have call successors, (112) [2025-03-03 14:21:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 882 transitions. [2025-03-03 14:21:06,573 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 882 transitions. Word has length 168 [2025-03-03 14:21:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:06,573 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 882 transitions. [2025-03-03 14:21:06,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-03 14:21:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 882 transitions. [2025-03-03 14:21:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 14:21:06,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:06,577 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:06,585 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-03 14:21:06,777 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,SelfDestructingSolverStorable3 [2025-03-03 14:21:06,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:06,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 787090768, now seen corresponding path program 1 times [2025-03-03 14:21:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818613105] [2025-03-03 14:21:06,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:06,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:06,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:21:06,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:21:06,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:06,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 14:21:06,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:06,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818613105] [2025-03-03 14:21:06,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818613105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:06,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:06,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:21:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849192353] [2025-03-03 14:21:06,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:06,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:21:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:06,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:21:06,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:21:06,994 INFO L87 Difference]: Start difference. First operand 598 states and 882 transitions. Second operand has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 states have internal predecessors, (99), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-03 14:21:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:07,083 INFO L93 Difference]: Finished difference Result 1121 states and 1661 transitions. [2025-03-03 14:21:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:21:07,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 states have internal predecessors, (99), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 169 [2025-03-03 14:21:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:07,091 INFO L225 Difference]: With dead ends: 1121 [2025-03-03 14:21:07,091 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 14:21:07,093 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-03 14:21:07,093 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 4 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5154 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:07,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5154 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:07,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 14:21:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 600. [2025-03-03 14:21:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 444 states have (on average 1.490990990990991) internal successors, (662), 464 states have internal predecessors, (662), 109 states have call successors, (109), 43 states have call predecessors, (109), 46 states have return successors, (113), 109 states have call predecessors, (113), 108 states have call successors, (113) [2025-03-03 14:21:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 884 transitions. [2025-03-03 14:21:07,130 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 884 transitions. Word has length 169 [2025-03-03 14:21:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:07,131 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 884 transitions. [2025-03-03 14:21:07,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 states have internal predecessors, (99), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-03 14:21:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 884 transitions. [2025-03-03 14:21:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 14:21:07,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:07,135 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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] [2025-03-03 14:21:07,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:21:07,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:07,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:07,136 INFO L85 PathProgramCache]: Analyzing trace with hash -972238479, now seen corresponding path program 1 times [2025-03-03 14:21:07,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:07,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628817615] [2025-03-03 14:21:07,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:07,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:07,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 14:21:07,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 14:21:07,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:07,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 14:21:07,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:07,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628817615] [2025-03-03 14:21:07,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628817615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:07,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:07,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:21:07,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050874796] [2025-03-03 14:21:07,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:07,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:21:07,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:07,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:21:07,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:21:07,368 INFO L87 Difference]: Start difference. First operand 600 states and 884 transitions. Second operand has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-03 14:21:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:07,460 INFO L93 Difference]: Finished difference Result 1125 states and 1667 transitions. [2025-03-03 14:21:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:21:07,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 170 [2025-03-03 14:21:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:07,465 INFO L225 Difference]: With dead ends: 1125 [2025-03-03 14:21:07,465 INFO L226 Difference]: Without dead ends: 605 [2025-03-03 14:21:07,467 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-03 14:21:07,468 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 2 mSDsluCounter, 4312 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:07,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:21:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-03 14:21:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 602. [2025-03-03 14:21:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 445 states have (on average 1.489887640449438) internal successors, (663), 466 states have internal predecessors, (663), 109 states have call successors, (109), 43 states have call predecessors, (109), 47 states have return successors, (116), 109 states have call predecessors, (116), 108 states have call successors, (116) [2025-03-03 14:21:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 888 transitions. [2025-03-03 14:21:07,490 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 888 transitions. Word has length 170 [2025-03-03 14:21:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:07,490 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 888 transitions. [2025-03-03 14:21:07,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-03 14:21:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 888 transitions. [2025-03-03 14:21:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 14:21:07,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:07,493 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:07,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:21:07,494 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:07,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:07,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1065057523, now seen corresponding path program 1 times [2025-03-03 14:21:07,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:07,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482365190] [2025-03-03 14:21:07,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:07,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:07,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 14:21:07,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 14:21:07,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:07,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:07,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:07,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482365190] [2025-03-03 14:21:07,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482365190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:07,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958118900] [2025-03-03 14:21:07,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:07,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:07,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:07,661 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-03 14:21:07,663 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-03 14:21:07,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 14:21:07,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 14:21:07,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:07,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:07,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 1417 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:21:07,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:08,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:21:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958118900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:21:08,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:21:08,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:21:08,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249742605] [2025-03-03 14:21:08,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:21:08,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:21:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:08,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:21:08,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:21:08,150 INFO L87 Difference]: Start difference. First operand 602 states and 888 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, (36), 2 states have call predecessors, (36), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:21:08,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:08,312 INFO L93 Difference]: Finished difference Result 1305 states and 1984 transitions. [2025-03-03 14:21:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:21:08,312 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, (36), 2 states have call predecessors, (36), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 171 [2025-03-03 14:21:08,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:08,318 INFO L225 Difference]: With dead ends: 1305 [2025-03-03 14:21:08,318 INFO L226 Difference]: Without dead ends: 980 [2025-03-03 14:21:08,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 339 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-03 14:21:08,320 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 800 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:08,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 2536 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:21:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2025-03-03 14:21:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 956. [2025-03-03 14:21:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 748 states have (on average 1.5681818181818181) internal successors, (1173), 775 states have internal predecessors, (1173), 160 states have call successors, (160), 43 states have call predecessors, (160), 47 states have return successors, (167), 160 states have call predecessors, (167), 159 states have call successors, (167) [2025-03-03 14:21:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1500 transitions. [2025-03-03 14:21:08,351 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1500 transitions. Word has length 171 [2025-03-03 14:21:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:08,351 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1500 transitions. [2025-03-03 14:21:08,351 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, (36), 2 states have call predecessors, (36), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:21:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1500 transitions. [2025-03-03 14:21:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 14:21:08,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:08,355 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:08,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:21:08,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:08,556 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:08,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash -238172165, now seen corresponding path program 1 times [2025-03-03 14:21:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:08,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204246236] [2025-03-03 14:21:08,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:08,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 14:21:08,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 14:21:08,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:08,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:08,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:08,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204246236] [2025-03-03 14:21:08,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204246236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:08,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:08,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:08,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905075291] [2025-03-03 14:21:08,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:08,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:08,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:08,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:08,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:08,630 INFO L87 Difference]: Start difference. First operand 956 states and 1500 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:08,661 INFO L93 Difference]: Finished difference Result 2073 states and 3297 transitions. [2025-03-03 14:21:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:08,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 176 [2025-03-03 14:21:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:08,667 INFO L225 Difference]: With dead ends: 2073 [2025-03-03 14:21:08,668 INFO L226 Difference]: Without dead ends: 1233 [2025-03-03 14:21:08,670 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-03 14:21:08,670 INFO L435 NwaCegarLoop]: 887 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, 1711 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-03 14:21:08,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1711 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-03-03 14:21:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1225. [2025-03-03 14:21:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 975 states have (on average 1.5835897435897437) internal successors, (1544), 1008 states have internal predecessors, (1544), 202 states have call successors, (202), 43 states have call predecessors, (202), 47 states have return successors, (209), 202 states have call predecessors, (209), 201 states have call successors, (209) [2025-03-03 14:21:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1955 transitions. [2025-03-03 14:21:08,708 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1955 transitions. Word has length 176 [2025-03-03 14:21:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:08,708 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1955 transitions. [2025-03-03 14:21:08,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1955 transitions. [2025-03-03 14:21:08,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 14:21:08,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:08,714 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:08,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:21:08,714 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:08,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2049559048, now seen corresponding path program 1 times [2025-03-03 14:21:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:08,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247358436] [2025-03-03 14:21:08,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:08,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 14:21:08,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 14:21:08,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:08,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247358436] [2025-03-03 14:21:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247358436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:08,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:08,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:08,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004536997] [2025-03-03 14:21:08,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:08,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:08,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:08,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:08,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:08,784 INFO L87 Difference]: Start difference. First operand 1225 states and 1955 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:08,846 INFO L93 Difference]: Finished difference Result 2817 states and 4569 transitions. [2025-03-03 14:21:08,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:08,846 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2025-03-03 14:21:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:08,854 INFO L225 Difference]: With dead ends: 2817 [2025-03-03 14:21:08,855 INFO L226 Difference]: Without dead ends: 1729 [2025-03-03 14:21:08,858 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-03 14:21:08,858 INFO L435 NwaCegarLoop]: 884 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, 1744 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-03 14:21:08,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1744 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:08,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2025-03-03 14:21:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1721. [2025-03-03 14:21:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1392 states have (on average 1.6041666666666667) internal successors, (2233), 1435 states have internal predecessors, (2233), 281 states have call successors, (281), 43 states have call predecessors, (281), 47 states have return successors, (288), 281 states have call predecessors, (288), 280 states have call successors, (288) [2025-03-03 14:21:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2802 transitions. [2025-03-03 14:21:08,915 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2802 transitions. Word has length 177 [2025-03-03 14:21:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:08,915 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2802 transitions. [2025-03-03 14:21:08,915 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2802 transitions. [2025-03-03 14:21:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 14:21:08,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:08,923 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:08,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:21:08,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:08,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:08,924 INFO L85 PathProgramCache]: Analyzing trace with hash -668488068, now seen corresponding path program 1 times [2025-03-03 14:21:08,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:08,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468128788] [2025-03-03 14:21:08,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:08,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 14:21:08,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 14:21:08,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:08,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:08,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:08,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468128788] [2025-03-03 14:21:08,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468128788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:08,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:08,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:08,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796766653] [2025-03-03 14:21:08,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:08,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:08,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:08,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:08,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:08,997 INFO L87 Difference]: Start difference. First operand 1721 states and 2802 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:09,055 INFO L93 Difference]: Finished difference Result 4053 states and 6683 transitions. [2025-03-03 14:21:09,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:09,056 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2025-03-03 14:21:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:09,069 INFO L225 Difference]: With dead ends: 4053 [2025-03-03 14:21:09,069 INFO L226 Difference]: Without dead ends: 2530 [2025-03-03 14:21:09,075 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-03 14:21:09,075 INFO L435 NwaCegarLoop]: 878 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, 1744 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-03 14:21:09,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1744 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:09,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2025-03-03 14:21:09,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2522. [2025-03-03 14:21:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2074 states have (on average 1.6190935390549663) internal successors, (3358), 2133 states have internal predecessors, (3358), 400 states have call successors, (400), 43 states have call predecessors, (400), 47 states have return successors, (407), 400 states have call predecessors, (407), 399 states have call successors, (407) [2025-03-03 14:21:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4165 transitions. [2025-03-03 14:21:09,167 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4165 transitions. Word has length 178 [2025-03-03 14:21:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:09,167 INFO L471 AbstractCegarLoop]: Abstraction has 2522 states and 4165 transitions. [2025-03-03 14:21:09,167 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4165 transitions. [2025-03-03 14:21:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 14:21:09,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:09,180 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:09,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:21:09,180 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:09,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:09,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1530938601, now seen corresponding path program 1 times [2025-03-03 14:21:09,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:09,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722761618] [2025-03-03 14:21:09,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:09,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:09,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 14:21:09,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 14:21:09,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:09,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:09,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:09,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722761618] [2025-03-03 14:21:09,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722761618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:09,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:09,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692322450] [2025-03-03 14:21:09,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:09,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:09,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:09,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:09,264 INFO L87 Difference]: Start difference. First operand 2522 states and 4165 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:09,371 INFO L93 Difference]: Finished difference Result 5934 states and 9897 transitions. [2025-03-03 14:21:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:09,371 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 179 [2025-03-03 14:21:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:09,391 INFO L225 Difference]: With dead ends: 5934 [2025-03-03 14:21:09,392 INFO L226 Difference]: Without dead ends: 3764 [2025-03-03 14:21:09,398 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-03 14:21:09,399 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 167 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1752 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-03 14:21:09,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1752 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2025-03-03 14:21:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3756. [2025-03-03 14:21:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3756 states, 3146 states have (on average 1.6306420851875398) internal successors, (5130), 3231 states have internal predecessors, (5130), 562 states have call successors, (562), 43 states have call predecessors, (562), 47 states have return successors, (569), 562 states have call predecessors, (569), 561 states have call successors, (569) [2025-03-03 14:21:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3756 states to 3756 states and 6261 transitions. [2025-03-03 14:21:09,552 INFO L78 Accepts]: Start accepts. Automaton has 3756 states and 6261 transitions. Word has length 179 [2025-03-03 14:21:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:09,554 INFO L471 AbstractCegarLoop]: Abstraction has 3756 states and 6261 transitions. [2025-03-03 14:21:09,554 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3756 states and 6261 transitions. [2025-03-03 14:21:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 14:21:09,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:09,574 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:09,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:21:09,574 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:09,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1648198269, now seen corresponding path program 1 times [2025-03-03 14:21:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:09,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138234559] [2025-03-03 14:21:09,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:09,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:09,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 14:21:09,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 14:21:09,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:09,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:09,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:09,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138234559] [2025-03-03 14:21:09,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138234559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:09,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:09,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325054716] [2025-03-03 14:21:09,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:09,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:09,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:09,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:09,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:09,657 INFO L87 Difference]: Start difference. First operand 3756 states and 6261 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:09,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:09,813 INFO L93 Difference]: Finished difference Result 8905 states and 14973 transitions. [2025-03-03 14:21:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:09,814 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 180 [2025-03-03 14:21:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:09,840 INFO L225 Difference]: With dead ends: 8905 [2025-03-03 14:21:09,840 INFO L226 Difference]: Without dead ends: 5756 [2025-03-03 14:21:09,849 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-03 14:21:09,849 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 165 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1741 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-03 14:21:09,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1741 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5756 states. [2025-03-03 14:21:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5756 to 5748. [2025-03-03 14:21:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5748 states, 4893 states have (on average 1.639280604945841) internal successors, (8021), 5022 states have internal predecessors, (8021), 807 states have call successors, (807), 43 states have call predecessors, (807), 47 states have return successors, (814), 807 states have call predecessors, (814), 806 states have call successors, (814) [2025-03-03 14:21:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5748 states to 5748 states and 9642 transitions. [2025-03-03 14:21:10,067 INFO L78 Accepts]: Start accepts. Automaton has 5748 states and 9642 transitions. Word has length 180 [2025-03-03 14:21:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:10,068 INFO L471 AbstractCegarLoop]: Abstraction has 5748 states and 9642 transitions. [2025-03-03 14:21:10,069 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5748 states and 9642 transitions. [2025-03-03 14:21:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 14:21:10,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:10,096 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:10,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:21:10,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:10,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:10,096 INFO L85 PathProgramCache]: Analyzing trace with hash 407321302, now seen corresponding path program 1 times [2025-03-03 14:21:10,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924485023] [2025-03-03 14:21:10,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:10,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:10,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 14:21:10,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 14:21:10,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:10,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:10,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:10,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924485023] [2025-03-03 14:21:10,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924485023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:10,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:10,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:10,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788603996] [2025-03-03 14:21:10,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:10,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:10,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:10,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:10,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:10,168 INFO L87 Difference]: Start difference. First operand 5748 states and 9642 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:10,414 INFO L93 Difference]: Finished difference Result 13842 states and 23412 transitions. [2025-03-03 14:21:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:10,414 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 181 [2025-03-03 14:21:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:10,466 INFO L225 Difference]: With dead ends: 13842 [2025-03-03 14:21:10,466 INFO L226 Difference]: Without dead ends: 9092 [2025-03-03 14:21:10,485 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-03 14:21:10,485 INFO L435 NwaCegarLoop]: 884 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, 1743 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-03 14:21:10,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1743 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9092 states. [2025-03-03 14:21:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9092 to 9084. [2025-03-03 14:21:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9084 states, 7736 states have (on average 1.641675284384695) internal successors, (12700), 7943 states have internal predecessors, (12700), 1300 states have call successors, (1300), 43 states have call predecessors, (1300), 47 states have return successors, (1307), 1300 states have call predecessors, (1307), 1299 states have call successors, (1307) [2025-03-03 14:21:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9084 states to 9084 states and 15307 transitions. [2025-03-03 14:21:10,833 INFO L78 Accepts]: Start accepts. Automaton has 9084 states and 15307 transitions. Word has length 181 [2025-03-03 14:21:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:10,834 INFO L471 AbstractCegarLoop]: Abstraction has 9084 states and 15307 transitions. [2025-03-03 14:21:10,836 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 9084 states and 15307 transitions. [2025-03-03 14:21:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 14:21:10,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:10,873 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:10,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:21:10,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:10,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:10,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1100819778, now seen corresponding path program 1 times [2025-03-03 14:21:10,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:10,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832153498] [2025-03-03 14:21:10,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:10,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:10,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 14:21:10,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 14:21:10,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:10,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:10,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:10,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832153498] [2025-03-03 14:21:10,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832153498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:10,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:10,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:10,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406955345] [2025-03-03 14:21:10,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:10,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:10,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:10,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:10,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:10,947 INFO L87 Difference]: Start difference. First operand 9084 states and 15307 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:11,215 INFO L93 Difference]: Finished difference Result 22690 states and 38534 transitions. [2025-03-03 14:21:11,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:11,216 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 182 [2025-03-03 14:21:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:11,263 INFO L225 Difference]: With dead ends: 22690 [2025-03-03 14:21:11,263 INFO L226 Difference]: Without dead ends: 15094 [2025-03-03 14:21:11,281 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-03 14:21:11,282 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 161 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1748 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-03 14:21:11,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1748 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15094 states. [2025-03-03 14:21:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15094 to 15086. [2025-03-03 14:21:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15086 states, 12916 states have (on average 1.645401052957572) internal successors, (21252), 13267 states have internal predecessors, (21252), 2122 states have call successors, (2122), 43 states have call predecessors, (2122), 47 states have return successors, (2129), 2122 states have call predecessors, (2129), 2121 states have call successors, (2129) [2025-03-03 14:21:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15086 states to 15086 states and 25503 transitions. [2025-03-03 14:21:11,747 INFO L78 Accepts]: Start accepts. Automaton has 15086 states and 25503 transitions. Word has length 182 [2025-03-03 14:21:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:11,748 INFO L471 AbstractCegarLoop]: Abstraction has 15086 states and 25503 transitions. [2025-03-03 14:21:11,748 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 15086 states and 25503 transitions. [2025-03-03 14:21:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 14:21:11,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:11,797 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:11,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:21:11,797 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:11,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:11,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1988569483, now seen corresponding path program 1 times [2025-03-03 14:21:11,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:11,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785614999] [2025-03-03 14:21:11,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:11,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:11,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 14:21:11,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 14:21:11,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:11,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:11,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:11,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785614999] [2025-03-03 14:21:11,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785614999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:11,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:11,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:11,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629229880] [2025-03-03 14:21:11,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:11,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:11,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:11,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:11,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:11,870 INFO L87 Difference]: Start difference. First operand 15086 states and 25503 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:12,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:12,404 INFO L93 Difference]: Finished difference Result 36297 states and 61344 transitions. [2025-03-03 14:21:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:12,404 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 183 [2025-03-03 14:21:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:12,494 INFO L225 Difference]: With dead ends: 36297 [2025-03-03 14:21:12,495 INFO L226 Difference]: Without dead ends: 23826 [2025-03-03 14:21:12,545 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-03 14:21:12,546 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 159 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1729 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-03 14:21:12,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1729 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23826 states. [2025-03-03 14:21:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23826 to 23818. [2025-03-03 14:21:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23818 states, 20445 states have (on average 1.6289557348985082) internal successors, (33304), 21070 states have internal predecessors, (33304), 3325 states have call successors, (3325), 43 states have call predecessors, (3325), 47 states have return successors, (3332), 3325 states have call predecessors, (3332), 3324 states have call successors, (3332) [2025-03-03 14:21:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23818 states to 23818 states and 39961 transitions. [2025-03-03 14:21:13,435 INFO L78 Accepts]: Start accepts. Automaton has 23818 states and 39961 transitions. Word has length 183 [2025-03-03 14:21:13,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:13,436 INFO L471 AbstractCegarLoop]: Abstraction has 23818 states and 39961 transitions. [2025-03-03 14:21:13,436 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 23818 states and 39961 transitions. [2025-03-03 14:21:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 14:21:13,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:13,500 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:13,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:21:13,500 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:13,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash -506739521, now seen corresponding path program 1 times [2025-03-03 14:21:13,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:13,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401846637] [2025-03-03 14:21:13,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:13,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 14:21:13,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 14:21:13,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:13,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:13,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401846637] [2025-03-03 14:21:13,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401846637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:13,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:13,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:13,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626917493] [2025-03-03 14:21:13,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:13,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:13,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:13,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:13,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:13,583 INFO L87 Difference]: Start difference. First operand 23818 states and 39961 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:14,165 INFO L93 Difference]: Finished difference Result 62755 states and 105609 transitions. [2025-03-03 14:21:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:14,165 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 184 [2025-03-03 14:21:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:14,414 INFO L225 Difference]: With dead ends: 62755 [2025-03-03 14:21:14,414 INFO L226 Difference]: Without dead ends: 42356 [2025-03-03 14:21:14,451 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-03 14:21:14,452 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-03 14:21:14,453 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-03 14:21:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42356 states. [2025-03-03 14:21:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42356 to 42348. [2025-03-03 14:21:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42348 states, 36525 states have (on average 1.6250513347022588) internal successors, (59355), 37416 states have internal predecessors, (59355), 5775 states have call successors, (5775), 43 states have call predecessors, (5775), 47 states have return successors, (5782), 5775 states have call predecessors, (5782), 5774 states have call successors, (5782) [2025-03-03 14:21:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42348 states to 42348 states and 70912 transitions. [2025-03-03 14:21:15,813 INFO L78 Accepts]: Start accepts. Automaton has 42348 states and 70912 transitions. Word has length 184 [2025-03-03 14:21:15,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:15,814 INFO L471 AbstractCegarLoop]: Abstraction has 42348 states and 70912 transitions. [2025-03-03 14:21:15,814 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 42348 states and 70912 transitions. [2025-03-03 14:21:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 14:21:15,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:15,929 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:15,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:21:15,929 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:15,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash -580208044, now seen corresponding path program 1 times [2025-03-03 14:21:15,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:15,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251187740] [2025-03-03 14:21:15,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:15,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:15,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 14:21:15,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 14:21:15,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:15,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:16,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:16,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251187740] [2025-03-03 14:21:16,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251187740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:16,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:16,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:16,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135013466] [2025-03-03 14:21:16,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:16,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:16,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:16,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:16,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:16,018 INFO L87 Difference]: Start difference. First operand 42348 states and 70912 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:17,293 INFO L93 Difference]: Finished difference Result 114637 states and 192711 transitions. [2025-03-03 14:21:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:17,294 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 185 [2025-03-03 14:21:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:17,599 INFO L225 Difference]: With dead ends: 114637 [2025-03-03 14:21:17,600 INFO L226 Difference]: Without dead ends: 76875 [2025-03-03 14:21:17,689 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-03 14:21:17,689 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 155 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1761 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-03 14:21:17,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1761 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76875 states. [2025-03-03 14:21:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76875 to 76867. [2025-03-03 14:21:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76867 states, 66531 states have (on average 1.624400655333604) internal successors, (108073), 68211 states have internal predecessors, (108073), 10288 states have call successors, (10288), 43 states have call predecessors, (10288), 47 states have return successors, (10295), 10288 states have call predecessors, (10295), 10287 states have call successors, (10295) [2025-03-03 14:21:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76867 states to 76867 states and 128656 transitions. [2025-03-03 14:21:20,055 INFO L78 Accepts]: Start accepts. Automaton has 76867 states and 128656 transitions. Word has length 185 [2025-03-03 14:21:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:20,058 INFO L471 AbstractCegarLoop]: Abstraction has 76867 states and 128656 transitions. [2025-03-03 14:21:20,058 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 76867 states and 128656 transitions. [2025-03-03 14:21:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 14:21:20,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:20,250 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:20,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:21:20,251 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:20,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:20,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2087747168, now seen corresponding path program 1 times [2025-03-03 14:21:20,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:20,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649472165] [2025-03-03 14:21:20,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:20,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:20,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 14:21:20,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 14:21:20,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:20,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:20,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:20,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649472165] [2025-03-03 14:21:20,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649472165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:20,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:20,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:20,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93647347] [2025-03-03 14:21:20,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:20,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:20,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:20,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:20,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:20,346 INFO L87 Difference]: Start difference. First operand 76867 states and 128656 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:22,393 INFO L93 Difference]: Finished difference Result 143592 states and 240356 transitions. [2025-03-03 14:21:22,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:22,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 186 [2025-03-03 14:21:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:22,917 INFO L225 Difference]: With dead ends: 143592 [2025-03-03 14:21:22,917 INFO L226 Difference]: Without dead ends: 143267 [2025-03-03 14:21:22,965 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-03 14:21:22,966 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 148 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:22,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1754 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143267 states. [2025-03-03 14:21:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143267 to 143259. [2025-03-03 14:21:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143259 states, 124555 states have (on average 1.6176147083617678) internal successors, (201482), 126758 states have internal predecessors, (201482), 18656 states have call successors, (18656), 43 states have call predecessors, (18656), 47 states have return successors, (18663), 18656 states have call predecessors, (18663), 18655 states have call successors, (18663) [2025-03-03 14:21:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143259 states to 143259 states and 238801 transitions. [2025-03-03 14:21:26,492 INFO L78 Accepts]: Start accepts. Automaton has 143259 states and 238801 transitions. Word has length 186 [2025-03-03 14:21:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:26,492 INFO L471 AbstractCegarLoop]: Abstraction has 143259 states and 238801 transitions. [2025-03-03 14:21:26,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:21:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 143259 states and 238801 transitions. [2025-03-03 14:21:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 14:21:26,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:26,684 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:26,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:21:26,685 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:26,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash 97052403, now seen corresponding path program 1 times [2025-03-03 14:21:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:26,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165805879] [2025-03-03 14:21:26,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:26,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:26,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 14:21:26,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 14:21:26,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:26,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-03 14:21:27,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:27,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165805879] [2025-03-03 14:21:27,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165805879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:27,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211892109] [2025-03-03 14:21:27,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:27,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:27,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:27,445 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-03 14:21:27,446 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-03 14:21:27,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 14:21:27,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 14:21:27,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:27,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:27,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 1479 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 14:21:27,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-03 14:21:28,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211892109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:28,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:28,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [25] total 43 [2025-03-03 14:21:28,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721251533] [2025-03-03 14:21:28,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:28,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:21:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:28,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:21:28,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1704, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 14:21:28,356 INFO L87 Difference]: Start difference. First operand 143259 states and 238801 transitions. Second operand has 20 states, 18 states have (on average 6.666666666666667) internal successors, (120), 15 states have internal predecessors, (120), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2025-03-03 14:21:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:33,016 INFO L93 Difference]: Finished difference Result 144045 states and 239948 transitions. [2025-03-03 14:21:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 14:21:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.666666666666667) internal successors, (120), 15 states have internal predecessors, (120), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) Word has length 187 [2025-03-03 14:21:33,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:33,724 INFO L225 Difference]: With dead ends: 144045 [2025-03-03 14:21:33,725 INFO L226 Difference]: Without dead ends: 143728 [2025-03-03 14:21:33,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=358, Invalid=4472, Unknown=0, NotChecked=0, Total=4830 [2025-03-03 14:21:33,792 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 1595 mSDsluCounter, 15623 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 16559 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:33,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 16559 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 14:21:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143728 states. [2025-03-03 14:21:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143728 to 143701. [2025-03-03 14:21:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143701 states, 124866 states have (on average 1.6170935242580047) internal successors, (201920), 127089 states have internal predecessors, (201920), 18747 states have call successors, (18747), 77 states have call predecessors, (18747), 87 states have return successors, (18788), 18752 states have call predecessors, (18788), 18745 states have call successors, (18788) [2025-03-03 14:21:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143701 states to 143701 states and 239455 transitions. [2025-03-03 14:21:37,505 INFO L78 Accepts]: Start accepts. Automaton has 143701 states and 239455 transitions. Word has length 187 [2025-03-03 14:21:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:37,506 INFO L471 AbstractCegarLoop]: Abstraction has 143701 states and 239455 transitions. [2025-03-03 14:21:37,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.666666666666667) internal successors, (120), 15 states have internal predecessors, (120), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2025-03-03 14:21:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 143701 states and 239455 transitions. [2025-03-03 14:21:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 14:21:37,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:37,686 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:37,694 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-03 14:21:37,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:37,886 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:37,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:37,887 INFO L85 PathProgramCache]: Analyzing trace with hash -802024706, now seen corresponding path program 1 times [2025-03-03 14:21:37,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:37,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847402844] [2025-03-03 14:21:37,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:37,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:37,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 14:21:37,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 14:21:37,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:37,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 14:21:38,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:38,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847402844] [2025-03-03 14:21:38,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847402844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:38,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:38,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:21:38,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238219472] [2025-03-03 14:21:38,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:38,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:38,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:38,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:38,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:38,002 INFO L87 Difference]: Start difference. First operand 143701 states and 239455 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21)