./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product15.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 b1bbd85396e3eb1de7562114efc1b104d28592355874c6166c296894ed6f999d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:36:15,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:36:15,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:36:15,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:36:15,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:36:15,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:36:15,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:36:15,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:36:15,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:36:15,369 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:36:15,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:36:15,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:36:15,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:36:15,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:36:15,369 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:36:15,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:36:15,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:36:15,370 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:36:15,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:36:15,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:36:15,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:36:15,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:36:15,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:36:15,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:36:15,370 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:36:15,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:36:15,370 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:36:15,370 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:36:15,371 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:36:15,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:36:15,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:36:15,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:36:15,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:36:15,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:36:15,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:36:15,371 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:36:15,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:36:15,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:36:15,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:36:15,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:36:15,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:36:15,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:36:15,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:36:15,372 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 -> b1bbd85396e3eb1de7562114efc1b104d28592355874c6166c296894ed6f999d [2025-03-08 05:36:15,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:36:15,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:36:15,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:36:15,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:36:15,620 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:36:15,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product15.cil.c [2025-03-08 05:36:16,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/862fc6c29/02eb9ad8c8d9452b96a1b63292f35b68/FLAG569d7b55d [2025-03-08 05:36:17,090 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:36:17,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product15.cil.c [2025-03-08 05:36:17,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/862fc6c29/02eb9ad8c8d9452b96a1b63292f35b68/FLAG569d7b55d [2025-03-08 05:36:17,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/862fc6c29/02eb9ad8c8d9452b96a1b63292f35b68 [2025-03-08 05:36:17,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:36:17,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:36:17,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:36:17,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:36:17,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:36:17,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:36:17" (1/1) ... [2025-03-08 05:36:17,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a5b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:17, skipping insertion in model container [2025-03-08 05:36:17,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:36:17" (1/1) ... [2025-03-08 05:36:17,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:36:17,799 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_spec8_product15.cil.c[44955,44968] [2025-03-08 05:36:17,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:36:17,888 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:36:17,895 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-03-08 05:36:17,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [460] [2025-03-08 05:36:17,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [750] [2025-03-08 05:36:17,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1824] [2025-03-08 05:36:17,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [2112] [2025-03-08 05:36:17,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2155] [2025-03-08 05:36:17,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2164] [2025-03-08 05:36:17,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2268] [2025-03-08 05:36:17,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2484] [2025-03-08 05:36:17,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2501] [2025-03-08 05:36:17,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2867] [2025-03-08 05:36:17,961 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_spec8_product15.cil.c[44955,44968] [2025-03-08 05:36:17,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:36:18,018 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:36:18,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18 WrapperNode [2025-03-08 05:36:18,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:36:18,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:36:18,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:36:18,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:36:18,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (1/1) ... [2025-03-08 05:36:18,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (1/1) ... [2025-03-08 05:36:18,095 INFO L138 Inliner]: procedures = 126, calls = 185, calls flagged for inlining = 55, calls inlined = 46, statements flattened = 889 [2025-03-08 05:36:18,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:36:18,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:36:18,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:36:18,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:36:18,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (1/1) ... [2025-03-08 05:36:18,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (1/1) ... [2025-03-08 05:36:18,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (1/1) ... [2025-03-08 05:36:18,134 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:36:18,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (1/1) ... [2025-03-08 05:36:18,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (1/1) ... [2025-03-08 05:36:18,153 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (1/1) ... [2025-03-08 05:36:18,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (1/1) ... [2025-03-08 05:36:18,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (1/1) ... [2025-03-08 05:36:18,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (1/1) ... [2025-03-08 05:36:18,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:36:18,162 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:36:18,162 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:36:18,162 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:36:18,163 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (1/1) ... [2025-03-08 05:36:18,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:36:18,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:18,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:36:18,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:36:18,211 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:36:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:36:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:36:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:36:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:36:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:36:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:36:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:36:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:36:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:36:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:36:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:36:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:36:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:36:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:36:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:36:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:36:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:36:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:36:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:36:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:36:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:36:18,213 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:36:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:36:18,213 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:36:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:36:18,213 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:36:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:36:18,213 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:36:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:36:18,213 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:36:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:36:18,213 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:36:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:36:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:36:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:36:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:36:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:36:18,213 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:36:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:36:18,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:36:18,352 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:36:18,356 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:36:18,563 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1366-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~25#1; [2025-03-08 05:36:18,563 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~15#1; [2025-03-08 05:36:18,563 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1682-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~30#1; [2025-03-08 05:36:18,563 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1319-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~24#1; [2025-03-08 05:36:18,564 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1801-1: getClientId_#res#1 := getClientId_~retValue_acc~32#1; [2025-03-08 05:36:18,602 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-03-08 05:36:18,629 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1458: #res#1 := ~retValue_acc~27#1; [2025-03-08 05:36:18,629 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1413-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~26#1; [2025-03-08 05:36:18,657 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265-1: createEmail_#res#1 := createEmail_~retValue_acc~37#1; [2025-03-08 05:36:18,673 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-03-08 05:36:18,908 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L688-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~13#1; [2025-03-08 05:36:18,909 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~14#1; [2025-03-08 05:36:18,909 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2899-1: valid_product_#res#1 := valid_product_~retValue_acc~43#1; [2025-03-08 05:36:18,909 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1628-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~29#1; [2025-03-08 05:36:18,909 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1521-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~28#1; [2025-03-08 05:36:18,909 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L679-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~12#1; [2025-03-08 05:36:18,916 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-03-08 05:36:18,938 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-03-08 05:36:19,029 INFO L? ?]: Removed 376 outVars from TransFormulas that were not future-live. [2025-03-08 05:36:19,029 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:36:19,047 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:36:19,050 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:36:19,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:36:19 BoogieIcfgContainer [2025-03-08 05:36:19,050 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:36:19,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:36:19,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:36:19,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:36:19,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:36:17" (1/3) ... [2025-03-08 05:36:19,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ead751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:36:19, skipping insertion in model container [2025-03-08 05:36:19,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:18" (2/3) ... [2025-03-08 05:36:19,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ead751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:36:19, skipping insertion in model container [2025-03-08 05:36:19,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:36:19" (3/3) ... [2025-03-08 05:36:19,061 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product15.cil.c [2025-03-08 05:36:19,075 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:36:19,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product15.cil.c that has 18 procedures, 285 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:36:19,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:36:19,148 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;@d52adf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:36:19,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:36:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 285 states, 224 states have (on average 1.5446428571428572) internal successors, (346), 228 states have internal predecessors, (346), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 05:36:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 05:36:19,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:19,164 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:19,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:19,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:19,169 INFO L85 PathProgramCache]: Analyzing trace with hash 336921990, now seen corresponding path program 1 times [2025-03-08 05:36:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:19,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650981084] [2025-03-08 05:36:19,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:19,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:19,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 05:36:19,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 05:36:19,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:19,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:36:19,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:19,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650981084] [2025-03-08 05:36:19,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650981084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:19,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803147329] [2025-03-08 05:36:19,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:19,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:19,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:19,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:36:19,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:36:19,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 05:36:19,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 05:36:19,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:19,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:19,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:36:19,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:36:20,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803147329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:20,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:20,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:36:20,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011363348] [2025-03-08 05:36:20,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:20,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:20,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:20,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:20,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:36:20,034 INFO L87 Difference]: Start difference. First operand has 285 states, 224 states have (on average 1.5446428571428572) internal successors, (346), 228 states have internal predecessors, (346), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:20,088 INFO L93 Difference]: Finished difference Result 419 states and 620 transitions. [2025-03-08 05:36:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:20,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2025-03-08 05:36:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:20,103 INFO L225 Difference]: With dead ends: 419 [2025-03-08 05:36:20,104 INFO L226 Difference]: Without dead ends: 279 [2025-03-08 05:36:20,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:36:20,110 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 0 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 849 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-08 05:36:20,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 849 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:20,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-08 05:36:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-03-08 05:36:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 219 states have (on average 1.538812785388128) internal successors, (337), 222 states have internal predecessors, (337), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 05:36:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 420 transitions. [2025-03-08 05:36:20,165 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 420 transitions. Word has length 89 [2025-03-08 05:36:20,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:20,167 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 420 transitions. [2025-03-08 05:36:20,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 420 transitions. [2025-03-08 05:36:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 05:36:20,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:20,174 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:20,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:36:20,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:36:20,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:20,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash 155263472, now seen corresponding path program 1 times [2025-03-08 05:36:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598614794] [2025-03-08 05:36:20,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:20,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 05:36:20,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:36:20,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:20,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:36:20,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:20,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598614794] [2025-03-08 05:36:20,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598614794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:20,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151472] [2025-03-08 05:36:20,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:20,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:20,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:20,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:36:20,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:36:20,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 05:36:20,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:36:20,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:20,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:20,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:36:20,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:36:20,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:20,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:20,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:20,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:36:20,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606227423] [2025-03-08 05:36:20,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:20,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:20,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:20,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:20,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:36:20,851 INFO L87 Difference]: Start difference. First operand 279 states and 420 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:20,893 INFO L93 Difference]: Finished difference Result 587 states and 898 transitions. [2025-03-08 05:36:20,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:20,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2025-03-08 05:36:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:20,903 INFO L225 Difference]: With dead ends: 587 [2025-03-08 05:36:20,903 INFO L226 Difference]: Without dead ends: 334 [2025-03-08 05:36:20,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:36:20,907 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 107 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:20,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 815 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-08 05:36:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 326. [2025-03-08 05:36:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 255 states have (on average 1.5568627450980392) internal successors, (397), 258 states have internal predecessors, (397), 53 states have call successors, (53), 17 states have call predecessors, (53), 17 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 05:36:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 502 transitions. [2025-03-08 05:36:20,927 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 502 transitions. Word has length 96 [2025-03-08 05:36:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:20,927 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 502 transitions. [2025-03-08 05:36:20,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 502 transitions. [2025-03-08 05:36:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 05:36:20,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:20,929 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:20,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:36:21,134 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,SelfDestructingSolverStorable1 [2025-03-08 05:36:21,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:21,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:21,135 INFO L85 PathProgramCache]: Analyzing trace with hash 192527761, now seen corresponding path program 1 times [2025-03-08 05:36:21,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:21,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207178323] [2025-03-08 05:36:21,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:21,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:21,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 05:36:21,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 05:36:21,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:21,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:36:21,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:21,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207178323] [2025-03-08 05:36:21,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207178323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:21,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648275474] [2025-03-08 05:36:21,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:21,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:21,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:21,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:36:21,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:36:21,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 05:36:21,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 05:36:21,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:21,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:21,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:36:21,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:36:21,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:21,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648275474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:21,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:21,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:36:21,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608994277] [2025-03-08 05:36:21,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:21,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:21,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:21,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:21,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:36:21,557 INFO L87 Difference]: Start difference. First operand 326 states and 502 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:36:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:21,610 INFO L93 Difference]: Finished difference Result 643 states and 994 transitions. [2025-03-08 05:36:21,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:21,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-03-08 05:36:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:21,613 INFO L225 Difference]: With dead ends: 643 [2025-03-08 05:36:21,613 INFO L226 Difference]: Without dead ends: 328 [2025-03-08 05:36:21,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:36:21,614 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 2 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:21,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1633 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-08 05:36:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-08 05:36:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 256 states have (on average 1.5546875) internal successors, (398), 260 states have internal predecessors, (398), 53 states have call successors, (53), 17 states have call predecessors, (53), 18 states have return successors, (54), 52 states have call predecessors, (54), 52 states have call successors, (54) [2025-03-08 05:36:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 505 transitions. [2025-03-08 05:36:21,628 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 505 transitions. Word has length 97 [2025-03-08 05:36:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:21,628 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 505 transitions. [2025-03-08 05:36:21,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:36:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 505 transitions. [2025-03-08 05:36:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 05:36:21,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:21,630 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:21,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:36:21,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:21,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:21,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:21,832 INFO L85 PathProgramCache]: Analyzing trace with hash 640876293, now seen corresponding path program 1 times [2025-03-08 05:36:21,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:21,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293608979] [2025-03-08 05:36:21,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:21,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:21,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:36:21,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:36:21,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:21,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:36:21,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:21,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293608979] [2025-03-08 05:36:21,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293608979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:21,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187765960] [2025-03-08 05:36:21,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:21,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:21,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:21,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:36:21,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:36:22,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:36:22,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:36:22,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:22,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:22,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:36:22,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:36:22,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:22,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187765960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:22,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:22,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:36:22,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275046134] [2025-03-08 05:36:22,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:22,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:22,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:22,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:22,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:36:22,237 INFO L87 Difference]: Start difference. First operand 328 states and 505 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:36:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:22,305 INFO L93 Difference]: Finished difference Result 645 states and 999 transitions. [2025-03-08 05:36:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:22,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2025-03-08 05:36:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:22,309 INFO L225 Difference]: With dead ends: 645 [2025-03-08 05:36:22,309 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 05:36:22,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:36:22,311 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 2 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:22,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1619 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 05:36:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-08 05:36:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 257 states have (on average 1.5525291828793775) internal successors, (399), 262 states have internal predecessors, (399), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2025-03-08 05:36:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 511 transitions. [2025-03-08 05:36:22,335 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 511 transitions. Word has length 98 [2025-03-08 05:36:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:22,335 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 511 transitions. [2025-03-08 05:36:22,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:36:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 511 transitions. [2025-03-08 05:36:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:36:22,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:22,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:22,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:36:22,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:22,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:22,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:22,539 INFO L85 PathProgramCache]: Analyzing trace with hash 736375977, now seen corresponding path program 1 times [2025-03-08 05:36:22,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:22,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608513135] [2025-03-08 05:36:22,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:22,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:22,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:36:22,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:36:22,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:22,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:36:22,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:22,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608513135] [2025-03-08 05:36:22,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608513135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:22,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:22,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730298921] [2025-03-08 05:36:22,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:22,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:22,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:22,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:22,715 INFO L87 Difference]: Start difference. First operand 330 states and 511 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:36:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:22,754 INFO L93 Difference]: Finished difference Result 637 states and 990 transitions. [2025-03-08 05:36:22,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:22,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2025-03-08 05:36:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:22,758 INFO L225 Difference]: With dead ends: 637 [2025-03-08 05:36:22,758 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 05:36:22,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:22,759 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 2 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:22,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1637 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 05:36:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-08 05:36:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 257 states have (on average 1.5525291828793775) internal successors, (399), 262 states have internal predecessors, (399), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (58), 52 states have call predecessors, (58), 52 states have call successors, (58) [2025-03-08 05:36:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 510 transitions. [2025-03-08 05:36:22,781 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 510 transitions. Word has length 99 [2025-03-08 05:36:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:22,781 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 510 transitions. [2025-03-08 05:36:22,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:36:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 510 transitions. [2025-03-08 05:36:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 05:36:22,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:22,784 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:22,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:36:22,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:22,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:22,784 INFO L85 PathProgramCache]: Analyzing trace with hash -833635521, now seen corresponding path program 2 times [2025-03-08 05:36:22,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:22,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555632774] [2025-03-08 05:36:22,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:36:22,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:22,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-08 05:36:22,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 05:36:22,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:36:22,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:36:22,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:22,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555632774] [2025-03-08 05:36:22,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555632774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:22,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:22,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:22,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838991108] [2025-03-08 05:36:22,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:22,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:22,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:22,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:22,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:22,923 INFO L87 Difference]: Start difference. First operand 330 states and 510 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:36:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:22,996 INFO L93 Difference]: Finished difference Result 635 states and 985 transitions. [2025-03-08 05:36:22,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:22,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2025-03-08 05:36:22,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:23,000 INFO L225 Difference]: With dead ends: 635 [2025-03-08 05:36:23,001 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 05:36:23,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:23,003 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 2 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:23,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1623 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 05:36:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-08 05:36:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 257 states have (on average 1.5525291828793775) internal successors, (399), 262 states have internal predecessors, (399), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (57), 52 states have call predecessors, (57), 52 states have call successors, (57) [2025-03-08 05:36:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 509 transitions. [2025-03-08 05:36:23,022 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 509 transitions. Word has length 100 [2025-03-08 05:36:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:23,023 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 509 transitions. [2025-03-08 05:36:23,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:36:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 509 transitions. [2025-03-08 05:36:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:36:23,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:23,025 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:23,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:36:23,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:23,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:23,026 INFO L85 PathProgramCache]: Analyzing trace with hash -474104507, now seen corresponding path program 3 times [2025-03-08 05:36:23,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:23,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837950794] [2025-03-08 05:36:23,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:36:23,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:23,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 101 statements into 3 equivalence classes. [2025-03-08 05:36:23,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 89 of 101 statements. [2025-03-08 05:36:23,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 05:36:23,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:36:23,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:23,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837950794] [2025-03-08 05:36:23,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837950794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:23,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:23,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:23,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640139767] [2025-03-08 05:36:23,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:23,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:23,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:23,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:23,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:23,140 INFO L87 Difference]: Start difference. First operand 330 states and 509 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:36:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:23,189 INFO L93 Difference]: Finished difference Result 637 states and 991 transitions. [2025-03-08 05:36:23,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:23,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2025-03-08 05:36:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:23,192 INFO L225 Difference]: With dead ends: 637 [2025-03-08 05:36:23,192 INFO L226 Difference]: Without dead ends: 332 [2025-03-08 05:36:23,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:23,194 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 1 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:23,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1634 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-08 05:36:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-08 05:36:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 258 states have (on average 1.550387596899225) internal successors, (400), 264 states have internal predecessors, (400), 53 states have call successors, (53), 17 states have call predecessors, (53), 20 states have return successors, (62), 52 states have call predecessors, (62), 52 states have call successors, (62) [2025-03-08 05:36:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 515 transitions. [2025-03-08 05:36:23,206 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 515 transitions. Word has length 101 [2025-03-08 05:36:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:23,207 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 515 transitions. [2025-03-08 05:36:23,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:36:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 515 transitions. [2025-03-08 05:36:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:36:23,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:23,209 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:23,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:36:23,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:23,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:23,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2135019006, now seen corresponding path program 1 times [2025-03-08 05:36:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:23,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305185730] [2025-03-08 05:36:23,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:23,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:23,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:36:23,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:36:23,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:23,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:36:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305185730] [2025-03-08 05:36:23,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305185730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:23,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:23,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:23,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8692639] [2025-03-08 05:36:23,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:23,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:23,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:23,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:23,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:23,336 INFO L87 Difference]: Start difference. First operand 332 states and 515 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:36:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:23,383 INFO L93 Difference]: Finished difference Result 643 states and 1001 transitions. [2025-03-08 05:36:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:23,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2025-03-08 05:36:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:23,387 INFO L225 Difference]: With dead ends: 643 [2025-03-08 05:36:23,387 INFO L226 Difference]: Without dead ends: 334 [2025-03-08 05:36:23,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:23,389 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 1 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:23,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1640 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-08 05:36:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-03-08 05:36:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 259 states have (on average 1.5482625482625483) internal successors, (401), 266 states have internal predecessors, (401), 53 states have call successors, (53), 17 states have call predecessors, (53), 21 states have return successors, (64), 52 states have call predecessors, (64), 52 states have call successors, (64) [2025-03-08 05:36:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 518 transitions. [2025-03-08 05:36:23,414 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 518 transitions. Word has length 102 [2025-03-08 05:36:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:23,415 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 518 transitions. [2025-03-08 05:36:23,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:36:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 518 transitions. [2025-03-08 05:36:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:36:23,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:23,418 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:23,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:36:23,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:23,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:23,419 INFO L85 PathProgramCache]: Analyzing trace with hash 579247791, now seen corresponding path program 1 times [2025-03-08 05:36:23,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:23,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814751744] [2025-03-08 05:36:23,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:23,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:23,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:36:23,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:36:23,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:23,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:36:23,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:23,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814751744] [2025-03-08 05:36:23,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814751744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:23,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715212002] [2025-03-08 05:36:23,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:23,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:23,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:23,561 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:36:23,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:36:23,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:36:23,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:36:23,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:23,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:23,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:36:23,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:23,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:36:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:23,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715212002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:36:23,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:36:23,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:36:23,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877117782] [2025-03-08 05:36:23,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:36:23,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:36:23,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:23,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:36:23,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:36:23,891 INFO L87 Difference]: Start difference. First operand 334 states and 518 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 05:36:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:24,377 INFO L93 Difference]: Finished difference Result 983 states and 1596 transitions. [2025-03-08 05:36:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:36:24,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 103 [2025-03-08 05:36:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:24,382 INFO L225 Difference]: With dead ends: 983 [2025-03-08 05:36:24,382 INFO L226 Difference]: Without dead ends: 677 [2025-03-08 05:36:24,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:36:24,384 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 1028 mSDsluCounter, 2588 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 3000 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:24,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 3000 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:36:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-08 05:36:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 653. [2025-03-08 05:36:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 514 states have (on average 1.6011673151750974) internal successors, (823), 520 states have internal predecessors, (823), 117 states have call successors, (117), 18 states have call predecessors, (117), 21 states have return successors, (138), 116 states have call predecessors, (138), 116 states have call successors, (138) [2025-03-08 05:36:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1078 transitions. [2025-03-08 05:36:24,413 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1078 transitions. Word has length 103 [2025-03-08 05:36:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:24,413 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1078 transitions. [2025-03-08 05:36:24,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 05:36:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1078 transitions. [2025-03-08 05:36:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:36:24,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:24,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:24,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:36:24,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:24,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:24,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1021862345, now seen corresponding path program 1 times [2025-03-08 05:36:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:24,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091326505] [2025-03-08 05:36:24,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:24,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:24,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:36:24,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:36:24,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:24,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:24,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:24,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091326505] [2025-03-08 05:36:24,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091326505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:24,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:24,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:24,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395940134] [2025-03-08 05:36:24,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:24,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:24,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:24,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:24,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:24,667 INFO L87 Difference]: Start difference. First operand 653 states and 1078 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:24,699 INFO L93 Difference]: Finished difference Result 1526 states and 2564 transitions. [2025-03-08 05:36:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:24,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2025-03-08 05:36:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:24,705 INFO L225 Difference]: With dead ends: 1526 [2025-03-08 05:36:24,705 INFO L226 Difference]: Without dead ends: 949 [2025-03-08 05:36:24,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:24,708 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 104 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:24,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 838 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-03-08 05:36:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 941. [2025-03-08 05:36:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 738 states have (on average 1.6205962059620596) internal successors, (1196), 744 states have internal predecessors, (1196), 181 states have call successors, (181), 18 states have call predecessors, (181), 21 states have return successors, (212), 180 states have call predecessors, (212), 180 states have call successors, (212) [2025-03-08 05:36:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1589 transitions. [2025-03-08 05:36:24,766 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1589 transitions. Word has length 107 [2025-03-08 05:36:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:24,766 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1589 transitions. [2025-03-08 05:36:24,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1589 transitions. [2025-03-08 05:36:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:36:24,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:24,771 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:24,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:36:24,771 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:24,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:24,771 INFO L85 PathProgramCache]: Analyzing trace with hash -21725909, now seen corresponding path program 1 times [2025-03-08 05:36:24,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:24,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930079608] [2025-03-08 05:36:24,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:24,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:24,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:36:24,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:36:24,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:24,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:24,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930079608] [2025-03-08 05:36:24,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930079608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:24,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:24,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:24,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179025783] [2025-03-08 05:36:24,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:24,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:24,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:24,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:24,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:24,820 INFO L87 Difference]: Start difference. First operand 941 states and 1589 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:24,875 INFO L93 Difference]: Finished difference Result 2238 states and 3800 transitions. [2025-03-08 05:36:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:24,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-08 05:36:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:24,885 INFO L225 Difference]: With dead ends: 2238 [2025-03-08 05:36:24,885 INFO L226 Difference]: Without dead ends: 1422 [2025-03-08 05:36:24,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:24,889 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 102 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:24,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 832 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-03-08 05:36:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1414. [2025-03-08 05:36:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1116 states have (on average 1.6290322580645162) internal successors, (1818), 1122 states have internal predecessors, (1818), 276 states have call successors, (276), 18 states have call predecessors, (276), 21 states have return successors, (307), 275 states have call predecessors, (307), 275 states have call successors, (307) [2025-03-08 05:36:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2401 transitions. [2025-03-08 05:36:24,951 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2401 transitions. Word has length 108 [2025-03-08 05:36:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:24,952 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2401 transitions. [2025-03-08 05:36:24,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2401 transitions. [2025-03-08 05:36:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:36:24,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:24,959 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:24,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:36:24,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:24,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2002428010, now seen corresponding path program 1 times [2025-03-08 05:36:24,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:24,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038616757] [2025-03-08 05:36:24,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:24,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:36:24,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:36:24,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:24,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:25,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:25,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038616757] [2025-03-08 05:36:25,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038616757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:25,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:25,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:25,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986978907] [2025-03-08 05:36:25,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:25,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:25,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:25,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:25,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:25,022 INFO L87 Difference]: Start difference. First operand 1414 states and 2401 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:25,113 INFO L93 Difference]: Finished difference Result 3294 states and 5638 transitions. [2025-03-08 05:36:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:25,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-03-08 05:36:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:25,128 INFO L225 Difference]: With dead ends: 3294 [2025-03-08 05:36:25,128 INFO L226 Difference]: Without dead ends: 2133 [2025-03-08 05:36:25,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:25,134 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 100 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:25,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 825 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2025-03-08 05:36:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2125. [2025-03-08 05:36:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 1704 states have (on average 1.636150234741784) internal successors, (2788), 1710 states have internal predecessors, (2788), 399 states have call successors, (399), 18 states have call predecessors, (399), 21 states have return successors, (446), 398 states have call predecessors, (446), 398 states have call successors, (446) [2025-03-08 05:36:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 3633 transitions. [2025-03-08 05:36:25,241 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 3633 transitions. Word has length 109 [2025-03-08 05:36:25,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:25,241 INFO L471 AbstractCegarLoop]: Abstraction has 2125 states and 3633 transitions. [2025-03-08 05:36:25,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 3633 transitions. [2025-03-08 05:36:25,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:36:25,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:25,249 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:25,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:36:25,249 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:25,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:25,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1118096150, now seen corresponding path program 1 times [2025-03-08 05:36:25,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:25,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208445673] [2025-03-08 05:36:25,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:25,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:25,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:36:25,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:36:25,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:25,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:25,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:25,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208445673] [2025-03-08 05:36:25,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208445673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:25,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:25,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:25,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390249197] [2025-03-08 05:36:25,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:25,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:25,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:25,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:25,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:25,303 INFO L87 Difference]: Start difference. First operand 2125 states and 3633 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:25,424 INFO L93 Difference]: Finished difference Result 4926 states and 8484 transitions. [2025-03-08 05:36:25,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:25,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-03-08 05:36:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:25,443 INFO L225 Difference]: With dead ends: 4926 [2025-03-08 05:36:25,443 INFO L226 Difference]: Without dead ends: 3262 [2025-03-08 05:36:25,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:25,451 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 98 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:25,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 825 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2025-03-08 05:36:25,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3254. [2025-03-08 05:36:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3254 states, 2654 states have (on average 1.6409193669932178) internal successors, (4355), 2660 states have internal predecessors, (4355), 578 states have call successors, (578), 18 states have call predecessors, (578), 21 states have return successors, (651), 577 states have call predecessors, (651), 577 states have call successors, (651) [2025-03-08 05:36:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 5584 transitions. [2025-03-08 05:36:25,629 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 5584 transitions. Word has length 110 [2025-03-08 05:36:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:25,629 INFO L471 AbstractCegarLoop]: Abstraction has 3254 states and 5584 transitions. [2025-03-08 05:36:25,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 5584 transitions. [2025-03-08 05:36:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:36:25,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:25,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:25,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:36:25,638 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:25,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:25,638 INFO L85 PathProgramCache]: Analyzing trace with hash -45999637, now seen corresponding path program 1 times [2025-03-08 05:36:25,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:25,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871761593] [2025-03-08 05:36:25,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:25,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:25,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:36:25,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:36:25,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:25,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871761593] [2025-03-08 05:36:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871761593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:25,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:25,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:25,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878974385] [2025-03-08 05:36:25,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:25,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:25,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:25,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:25,696 INFO L87 Difference]: Start difference. First operand 3254 states and 5584 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:25,862 INFO L93 Difference]: Finished difference Result 7866 states and 13567 transitions. [2025-03-08 05:36:25,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:25,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-03-08 05:36:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:25,888 INFO L225 Difference]: With dead ends: 7866 [2025-03-08 05:36:25,888 INFO L226 Difference]: Without dead ends: 5309 [2025-03-08 05:36:25,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:25,896 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 96 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:25,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 838 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2025-03-08 05:36:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5301. [2025-03-08 05:36:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5301 states, 4325 states have (on average 1.6339884393063584) internal successors, (7067), 4331 states have internal predecessors, (7067), 954 states have call successors, (954), 18 states have call predecessors, (954), 21 states have return successors, (1071), 953 states have call predecessors, (1071), 953 states have call successors, (1071) [2025-03-08 05:36:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5301 states to 5301 states and 9092 transitions. [2025-03-08 05:36:26,173 INFO L78 Accepts]: Start accepts. Automaton has 5301 states and 9092 transitions. Word has length 111 [2025-03-08 05:36:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:26,174 INFO L471 AbstractCegarLoop]: Abstraction has 5301 states and 9092 transitions. [2025-03-08 05:36:26,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 5301 states and 9092 transitions. [2025-03-08 05:36:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:36:26,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:26,188 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:26,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:36:26,188 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:26,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:26,188 INFO L85 PathProgramCache]: Analyzing trace with hash -999453335, now seen corresponding path program 1 times [2025-03-08 05:36:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:26,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046114686] [2025-03-08 05:36:26,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:26,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:26,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:36:26,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:36:26,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:26,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:26,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:26,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046114686] [2025-03-08 05:36:26,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046114686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:26,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:26,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:26,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635456836] [2025-03-08 05:36:26,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:26,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:26,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:26,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:26,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:26,250 INFO L87 Difference]: Start difference. First operand 5301 states and 9092 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:26,546 INFO L93 Difference]: Finished difference Result 13050 states and 22519 transitions. [2025-03-08 05:36:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:26,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-03-08 05:36:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:26,591 INFO L225 Difference]: With dead ends: 13050 [2025-03-08 05:36:26,591 INFO L226 Difference]: Without dead ends: 8826 [2025-03-08 05:36:26,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:26,603 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 94 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:26,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 828 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8826 states. [2025-03-08 05:36:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8826 to 8818. [2025-03-08 05:36:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8818 states, 7236 states have (on average 1.6318407960199004) internal successors, (11808), 7242 states have internal predecessors, (11808), 1560 states have call successors, (1560), 18 states have call predecessors, (1560), 21 states have return successors, (1755), 1559 states have call predecessors, (1755), 1559 states have call successors, (1755) [2025-03-08 05:36:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8818 states to 8818 states and 15123 transitions. [2025-03-08 05:36:27,007 INFO L78 Accepts]: Start accepts. Automaton has 8818 states and 15123 transitions. Word has length 112 [2025-03-08 05:36:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:27,007 INFO L471 AbstractCegarLoop]: Abstraction has 8818 states and 15123 transitions. [2025-03-08 05:36:27,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 8818 states and 15123 transitions. [2025-03-08 05:36:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:36:27,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:27,025 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:27,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:36:27,026 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:27,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1299599308, now seen corresponding path program 1 times [2025-03-08 05:36:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:27,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84392872] [2025-03-08 05:36:27,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:27,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:27,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:36:27,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:36:27,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:27,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:27,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:27,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84392872] [2025-03-08 05:36:27,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84392872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:27,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:27,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:27,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696215762] [2025-03-08 05:36:27,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:27,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:27,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:27,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:27,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:27,074 INFO L87 Difference]: Start difference. First operand 8818 states and 15123 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:27,427 INFO L93 Difference]: Finished difference Result 22794 states and 39239 transitions. [2025-03-08 05:36:27,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:27,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-03-08 05:36:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:27,484 INFO L225 Difference]: With dead ends: 22794 [2025-03-08 05:36:27,485 INFO L226 Difference]: Without dead ends: 15476 [2025-03-08 05:36:27,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:27,515 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 92 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:27,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 839 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:27,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15476 states. [2025-03-08 05:36:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15476 to 15468. [2025-03-08 05:36:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15468 states, 12683 states have (on average 1.6222502562485217) internal successors, (20575), 12689 states have internal predecessors, (20575), 2763 states have call successors, (2763), 18 states have call predecessors, (2763), 21 states have return successors, (3102), 2762 states have call predecessors, (3102), 2762 states have call successors, (3102) [2025-03-08 05:36:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15468 states to 15468 states and 26440 transitions. [2025-03-08 05:36:28,321 INFO L78 Accepts]: Start accepts. Automaton has 15468 states and 26440 transitions. Word has length 113 [2025-03-08 05:36:28,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:28,321 INFO L471 AbstractCegarLoop]: Abstraction has 15468 states and 26440 transitions. [2025-03-08 05:36:28,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 15468 states and 26440 transitions. [2025-03-08 05:36:28,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:36:28,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:28,345 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:28,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:36:28,345 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:28,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:28,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1344826664, now seen corresponding path program 1 times [2025-03-08 05:36:28,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:28,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885684016] [2025-03-08 05:36:28,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:28,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:36:28,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:36:28,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:28,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:28,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:28,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885684016] [2025-03-08 05:36:28,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885684016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:28,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:28,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:28,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131215638] [2025-03-08 05:36:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:28,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:28,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:28,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:28,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:28,392 INFO L87 Difference]: Start difference. First operand 15468 states and 26440 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:29,003 INFO L93 Difference]: Finished difference Result 40925 states and 70261 transitions. [2025-03-08 05:36:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:29,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2025-03-08 05:36:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:29,111 INFO L225 Difference]: With dead ends: 40925 [2025-03-08 05:36:29,111 INFO L226 Difference]: Without dead ends: 27562 [2025-03-08 05:36:29,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:29,159 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 90 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:29,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 828 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:29,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27562 states. [2025-03-08 05:36:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27562 to 27554. [2025-03-08 05:36:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27554 states, 22730 states have (on average 1.6178178618565773) internal successors, (36773), 22736 states have internal predecessors, (36773), 4802 states have call successors, (4802), 18 states have call predecessors, (4802), 21 states have return successors, (5415), 4801 states have call predecessors, (5415), 4801 states have call successors, (5415) [2025-03-08 05:36:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27554 states to 27554 states and 46990 transitions. [2025-03-08 05:36:30,285 INFO L78 Accepts]: Start accepts. Automaton has 27554 states and 46990 transitions. Word has length 114 [2025-03-08 05:36:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:30,286 INFO L471 AbstractCegarLoop]: Abstraction has 27554 states and 46990 transitions. [2025-03-08 05:36:30,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 27554 states and 46990 transitions. [2025-03-08 05:36:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:36:30,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:30,315 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:30,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:36:30,316 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:30,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:30,317 INFO L85 PathProgramCache]: Analyzing trace with hash 941974157, now seen corresponding path program 1 times [2025-03-08 05:36:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:30,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657239180] [2025-03-08 05:36:30,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:30,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:30,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:36:30,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:36:30,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:30,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:30,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:30,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657239180] [2025-03-08 05:36:30,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657239180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:30,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:30,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:30,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539243556] [2025-03-08 05:36:30,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:30,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:30,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:30,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:30,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:30,391 INFO L87 Difference]: Start difference. First operand 27554 states and 46990 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:31,683 INFO L93 Difference]: Finished difference Result 75072 states and 128478 transitions. [2025-03-08 05:36:31,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:31,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2025-03-08 05:36:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:31,884 INFO L225 Difference]: With dead ends: 75072 [2025-03-08 05:36:31,884 INFO L226 Difference]: Without dead ends: 50349 [2025-03-08 05:36:31,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:31,947 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 88 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:31,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 839 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50349 states. [2025-03-08 05:36:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50349 to 50341. [2025-03-08 05:36:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50341 states, 41802 states have (on average 1.6119802880244964) internal successors, (67384), 41808 states have internal predecessors, (67384), 8517 states have call successors, (8517), 18 states have call predecessors, (8517), 21 states have return successors, (9662), 8516 states have call predecessors, (9662), 8516 states have call successors, (9662) [2025-03-08 05:36:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50341 states to 50341 states and 85563 transitions. [2025-03-08 05:36:33,716 INFO L78 Accepts]: Start accepts. Automaton has 50341 states and 85563 transitions. Word has length 115 [2025-03-08 05:36:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:33,716 INFO L471 AbstractCegarLoop]: Abstraction has 50341 states and 85563 transitions. [2025-03-08 05:36:33,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 50341 states and 85563 transitions. [2025-03-08 05:36:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:36:33,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:33,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:33,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:36:33,739 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:33,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2138694727, now seen corresponding path program 1 times [2025-03-08 05:36:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:33,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195566880] [2025-03-08 05:36:33,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:33,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:36:33,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:36:33,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:33,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:33,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:33,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195566880] [2025-03-08 05:36:33,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195566880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:33,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:33,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:33,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464697758] [2025-03-08 05:36:33,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:33,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:33,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:33,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:33,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:33,796 INFO L87 Difference]: Start difference. First operand 50341 states and 85563 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:35,545 INFO L93 Difference]: Finished difference Result 93814 states and 159810 transitions. [2025-03-08 05:36:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:35,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2025-03-08 05:36:35,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:35,925 INFO L225 Difference]: With dead ends: 93814 [2025-03-08 05:36:35,925 INFO L226 Difference]: Without dead ends: 93687 [2025-03-08 05:36:35,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:35,980 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 83 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 842 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-08 05:36:35,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 842 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93687 states. [2025-03-08 05:36:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93687 to 93679. [2025-03-08 05:36:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93679 states, 78341 states have (on average 1.6046514596443753) internal successors, (125710), 78347 states have internal predecessors, (125710), 15316 states have call successors, (15316), 18 states have call predecessors, (15316), 21 states have return successors, (17507), 15315 states have call predecessors, (17507), 15315 states have call successors, (17507) [2025-03-08 05:36:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93679 states to 93679 states and 158533 transitions. [2025-03-08 05:36:39,165 INFO L78 Accepts]: Start accepts. Automaton has 93679 states and 158533 transitions. Word has length 116 [2025-03-08 05:36:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:39,166 INFO L471 AbstractCegarLoop]: Abstraction has 93679 states and 158533 transitions. [2025-03-08 05:36:39,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:36:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 93679 states and 158533 transitions. [2025-03-08 05:36:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:36:39,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:39,191 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:39,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:36:39,191 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:39,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:39,192 INFO L85 PathProgramCache]: Analyzing trace with hash 885370254, now seen corresponding path program 1 times [2025-03-08 05:36:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:39,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897106234] [2025-03-08 05:36:39,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:39,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:39,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:36:39,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:36:39,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:39,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:39,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:39,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897106234] [2025-03-08 05:36:39,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897106234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:39,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:39,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 05:36:39,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492407224] [2025-03-08 05:36:39,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:39,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:36:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:39,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:36:39,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:36:39,718 INFO L87 Difference]: Start difference. First operand 93679 states and 158533 transitions. Second operand has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 states have internal predecessors, (80), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-08 05:36:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:43,916 INFO L93 Difference]: Finished difference Result 186706 states and 321444 transitions. [2025-03-08 05:36:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 05:36:43,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 states have internal predecessors, (80), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 117 [2025-03-08 05:36:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:44,671 INFO L225 Difference]: With dead ends: 186706 [2025-03-08 05:36:44,671 INFO L226 Difference]: Without dead ends: 186585 [2025-03-08 05:36:44,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:36:44,742 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 1013 mSDsluCounter, 4551 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 5090 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:44,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 5090 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:36:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186585 states. [2025-03-08 05:36:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186585 to 186548. [2025-03-08 05:36:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186548 states, 156080 states have (on average 1.6055228088159919) internal successors, (250590), 155982 states have internal predecessors, (250590), 30417 states have call successors, (30417), 44 states have call predecessors, (30417), 50 states have return successors, (38070), 30527 states have call predecessors, (38070), 30414 states have call successors, (38070) [2025-03-08 05:36:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186548 states to 186548 states and 319077 transitions. [2025-03-08 05:36:51,293 INFO L78 Accepts]: Start accepts. Automaton has 186548 states and 319077 transitions. Word has length 117 [2025-03-08 05:36:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:51,293 INFO L471 AbstractCegarLoop]: Abstraction has 186548 states and 319077 transitions. [2025-03-08 05:36:51,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 states have internal predecessors, (80), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-08 05:36:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 186548 states and 319077 transitions. [2025-03-08 05:36:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:36:51,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:51,344 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:51,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:36:51,344 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:51,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash 137472249, now seen corresponding path program 1 times [2025-03-08 05:36:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:51,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8131826] [2025-03-08 05:36:51,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:51,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:51,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:36:51,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:36:51,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:51,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:51,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:51,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8131826] [2025-03-08 05:36:51,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8131826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:51,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:51,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:51,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030740821] [2025-03-08 05:36:51,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:51,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:51,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:51,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:51,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:51,431 INFO L87 Difference]: Start difference. First operand 186548 states and 319077 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)