./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product32.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_spec3_product32.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 f844ee25e08c400ffe9294b51b3c9849047d932ed3d2e45badb4ba2d0884ce06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:33:24,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:33:24,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:33:24,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:33:24,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:33:24,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:33:24,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:33:24,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:33:24,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:33:24,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:33:24,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:33:24,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:33:24,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:33:24,246 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:33:24,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:33:24,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:33:24,247 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 -> f844ee25e08c400ffe9294b51b3c9849047d932ed3d2e45badb4ba2d0884ce06 [2025-03-08 05:33:24,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:33:24,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:33:24,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:33:24,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:33:24,491 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:33:24,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product32.cil.c [2025-03-08 05:33:25,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dda6460/d93e206cd9b545d1b354b49a3a1e2279/FLAG2295a9df2 [2025-03-08 05:33:25,916 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:33:25,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product32.cil.c [2025-03-08 05:33:25,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dda6460/d93e206cd9b545d1b354b49a3a1e2279/FLAG2295a9df2 [2025-03-08 05:33:25,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dda6460/d93e206cd9b545d1b354b49a3a1e2279 [2025-03-08 05:33:25,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:33:25,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:33:25,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:33:25,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:33:25,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:33:25,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:33:25" (1/1) ... [2025-03-08 05:33:25,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28118e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:25, skipping insertion in model container [2025-03-08 05:33:25,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:33:25" (1/1) ... [2025-03-08 05:33:26,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:33:26,149 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_spec3_product32.cil.c[1542,1555] [2025-03-08 05:33:26,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:33:26,452 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:33:26,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-03-08 05:33:26,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [57] [2025-03-08 05:33:26,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [106] [2025-03-08 05:33:26,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [541] [2025-03-08 05:33:26,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [558] [2025-03-08 05:33:26,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [787] [2025-03-08 05:33:26,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [845] [2025-03-08 05:33:26,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1917] [2025-03-08 05:33:26,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2205] [2025-03-08 05:33:26,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2343] [2025-03-08 05:33:26,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2740] [2025-03-08 05:33:26,469 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_spec3_product32.cil.c[1542,1555] [2025-03-08 05:33:26,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:33:26,583 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:33:26,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:26 WrapperNode [2025-03-08 05:33:26,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:33:26,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:33:26,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:33:26,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:33:26,590 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:33:26" (1/1) ... [2025-03-08 05:33:26,606 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:33:26" (1/1) ... [2025-03-08 05:33:26,652 INFO L138 Inliner]: procedures = 135, calls = 226, calls flagged for inlining = 61, calls inlined = 53, statements flattened = 1014 [2025-03-08 05:33:26,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:33:26,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:33:26,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:33:26,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:33:26,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:26" (1/1) ... [2025-03-08 05:33:26,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:26" (1/1) ... [2025-03-08 05:33:26,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:26" (1/1) ... [2025-03-08 05:33:26,689 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:33:26,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:26" (1/1) ... [2025-03-08 05:33:26,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:26" (1/1) ... [2025-03-08 05:33:26,701 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:26" (1/1) ... [2025-03-08 05:33:26,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:26" (1/1) ... [2025-03-08 05:33:26,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:26" (1/1) ... [2025-03-08 05:33:26,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:26" (1/1) ... [2025-03-08 05:33:26,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:33:26,713 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:33:26,713 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:33:26,713 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:33:26,714 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:26" (1/1) ... [2025-03-08 05:33:26,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:33:26,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:26,751 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:33:26,754 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:33:26,773 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:33:26,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:33:26,774 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:33:26,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:33:26,774 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:33:26,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:33:26,774 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:33:26,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:33:26,774 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:33:26,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:33:26,774 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:33:26,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:33:26,774 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:33:26,775 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:33:26,775 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:33:26,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:33:26,775 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:33:26,775 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:33:26,775 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:33:26,775 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:33:26,775 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:33:26,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:33:26,775 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:33:26,775 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:33:26,775 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:33:26,775 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:33:26,776 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:33:26,776 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:33:26,776 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:33:26,776 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:33:26,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:33:26,776 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:33:26,776 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:33:26,776 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:33:26,776 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:33:26,776 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:33:26,776 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:33:26,776 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:33:26,776 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:33:26,776 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:33:26,777 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:33:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:33:26,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:33:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:33:26,777 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:33:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:33:26,777 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:33:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:33:26,777 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:33:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:33:26,777 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:33:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:33:26,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:33:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:33:26,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:33:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:33:26,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:33:26,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:33:26,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:33:26,779 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:33:26,779 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:33:26,779 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:33:26,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:33:26,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:33:26,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:33:26,945 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:33:26,948 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:33:27,063 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2647: #res := ~retValue_acc~38; [2025-03-08 05:33:27,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L431: #res := ~retValue_acc~6; [2025-03-08 05:33:27,118 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1506-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~18#1; [2025-03-08 05:33:27,119 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1551: #res#1 := ~retValue_acc~19#1; [2025-03-08 05:33:27,147 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1775: #res := ~retValue_acc~22; [2025-03-08 05:33:27,164 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1459: #res := ~retValue_acc~17; [2025-03-08 05:33:27,172 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2340-1: createEmail_#res#1 := createEmail_~retValue_acc~29#1; [2025-03-08 05:33:27,180 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003: #res := ~retValue_acc~11; [2025-03-08 05:33:27,190 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2573: #res := ~retValue_acc~36; [2025-03-08 05:33:27,237 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2610: #res := ~retValue_acc~37; [2025-03-08 05:33:27,247 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2684: #res := ~retValue_acc~39; [2025-03-08 05:33:27,281 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2458: #res := ~retValue_acc~33; [2025-03-08 05:33:27,327 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1329: #res := ~retValue_acc~15; [2025-03-08 05:33:27,458 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-1: getClientId_#res#1 := getClientId_~retValue_acc~24#1; [2025-03-08 05:33:27,459 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1412-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~16#1; [2025-03-08 05:33:27,679 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1721-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~21#1; [2025-03-08 05:33:27,679 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-08 05:33:27,679 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L388-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~3#1; [2025-03-08 05:33:27,679 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L406-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~5#1; [2025-03-08 05:33:27,679 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1614-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~20#1; [2025-03-08 05:33:27,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L397-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~4#1; [2025-03-08 05:33:27,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2421: #res := ~retValue_acc~32; [2025-03-08 05:33:27,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2316: #res#1 := ~retValue_acc~27#1; [2025-03-08 05:33:27,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2296-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~26#1; [2025-03-08 05:33:27,843 INFO L? ?]: Removed 543 outVars from TransFormulas that were not future-live. [2025-03-08 05:33:27,843 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:33:27,866 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:33:27,866 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:33:27,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:27 BoogieIcfgContainer [2025-03-08 05:33:27,866 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:33:27,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:33:27,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:33:27,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:33:27,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:33:25" (1/3) ... [2025-03-08 05:33:27,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70873f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:27, skipping insertion in model container [2025-03-08 05:33:27,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:26" (2/3) ... [2025-03-08 05:33:27,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70873f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:27, skipping insertion in model container [2025-03-08 05:33:27,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:27" (3/3) ... [2025-03-08 05:33:27,877 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product32.cil.c [2025-03-08 05:33:27,890 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:33:27,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product32.cil.c that has 30 procedures, 434 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:33:27,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:33:27,972 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;@694a1770, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:33:27,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:33:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 434 states, 333 states have (on average 1.5465465465465464) internal successors, (515), 340 states have internal predecessors, (515), 70 states have call successors, (70), 29 states have call predecessors, (70), 29 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 05:33:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:33:27,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:27,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:27,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:28,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:28,002 INFO L85 PathProgramCache]: Analyzing trace with hash 956099719, now seen corresponding path program 1 times [2025-03-08 05:33:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:28,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635839663] [2025-03-08 05:33:28,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:28,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:28,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:33:28,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:33:28,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:28,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:33:28,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:28,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635839663] [2025-03-08 05:33:28,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635839663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:28,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979968733] [2025-03-08 05:33:28,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:28,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:28,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:28,769 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:33:28,771 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:33:28,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:33:29,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:33:29,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:29,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:29,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:33:29,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 05:33:29,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:29,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979968733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:29,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:29,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:33:29,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997690431] [2025-03-08 05:33:29,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:29,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:29,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:29,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:29,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:33:29,131 INFO L87 Difference]: Start difference. First operand has 434 states, 333 states have (on average 1.5465465465465464) internal successors, (515), 340 states have internal predecessors, (515), 70 states have call successors, (70), 29 states have call predecessors, (70), 29 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:33:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:29,201 INFO L93 Difference]: Finished difference Result 677 states and 1006 transitions. [2025-03-08 05:33:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:29,204 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 139 [2025-03-08 05:33:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:29,216 INFO L225 Difference]: With dead ends: 677 [2025-03-08 05:33:29,218 INFO L226 Difference]: Without dead ends: 427 [2025-03-08 05:33:29,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 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:33:29,225 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 0 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1295 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:33:29,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1295 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-08 05:33:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-03-08 05:33:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 328 states have (on average 1.5426829268292683) internal successors, (506), 333 states have internal predecessors, (506), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 05:33:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 643 transitions. [2025-03-08 05:33:29,291 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 643 transitions. Word has length 139 [2025-03-08 05:33:29,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:29,293 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 643 transitions. [2025-03-08 05:33:29,294 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:33:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 643 transitions. [2025-03-08 05:33:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 05:33:29,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:29,300 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:29,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:33:29,501 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:33:29,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:29,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1916499528, now seen corresponding path program 1 times [2025-03-08 05:33:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:29,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793935636] [2025-03-08 05:33:29,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:29,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 05:33:29,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 05:33:29,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:29,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 05:33:29,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:29,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793935636] [2025-03-08 05:33:29,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793935636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:29,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579453405] [2025-03-08 05:33:29,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:29,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:29,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:29,795 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:33:29,796 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:33:29,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 05:33:30,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 05:33:30,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:30,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:30,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 1345 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:33:30,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 05:33:30,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:30,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579453405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:30,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:30,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:33:30,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640265002] [2025-03-08 05:33:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:30,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:30,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:30,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:30,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:33:30,150 INFO L87 Difference]: Start difference. First operand 427 states and 643 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:30,216 INFO L93 Difference]: Finished difference Result 901 states and 1377 transitions. [2025-03-08 05:33:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:30,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 165 [2025-03-08 05:33:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:30,222 INFO L225 Difference]: With dead ends: 901 [2025-03-08 05:33:30,222 INFO L226 Difference]: Without dead ends: 500 [2025-03-08 05:33:30,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 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:33:30,227 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 134 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1262 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:33:30,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1262 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-08 05:33:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 492. [2025-03-08 05:33:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 379 states have (on average 1.5646437994722955) internal successors, (593), 384 states have internal predecessors, (593), 84 states have call successors, (84), 29 states have call predecessors, (84), 28 states have return successors, (81), 80 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:33:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 758 transitions. [2025-03-08 05:33:30,269 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 758 transitions. Word has length 165 [2025-03-08 05:33:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:30,269 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 758 transitions. [2025-03-08 05:33:30,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 758 transitions. [2025-03-08 05:33:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 05:33:30,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:30,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:30,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:33:30,481 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:33:30,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:30,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash -129782862, now seen corresponding path program 1 times [2025-03-08 05:33:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:30,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658963555] [2025-03-08 05:33:30,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:30,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 05:33:30,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 05:33:30,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:30,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:33:30,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:30,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658963555] [2025-03-08 05:33:30,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658963555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:30,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030890592] [2025-03-08 05:33:30,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:30,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:30,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:30,673 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:33:30,675 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:33:30,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 05:33:30,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 05:33:30,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:30,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:30,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:33:30,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:33:31,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:31,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030890592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:31,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:31,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:33:31,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140291362] [2025-03-08 05:33:31,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:31,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:31,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:31,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:31,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:33:31,031 INFO L87 Difference]: Start difference. First operand 492 states and 758 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:33:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:31,097 INFO L93 Difference]: Finished difference Result 975 states and 1506 transitions. [2025-03-08 05:33:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:31,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-03-08 05:33:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:31,100 INFO L225 Difference]: With dead ends: 975 [2025-03-08 05:33:31,100 INFO L226 Difference]: Without dead ends: 494 [2025-03-08 05:33:31,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 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:33:31,103 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 2 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2525 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:33:31,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2525 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:31,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-08 05:33:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2025-03-08 05:33:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 380 states have (on average 1.563157894736842) internal successors, (594), 386 states have internal predecessors, (594), 84 states have call successors, (84), 29 states have call predecessors, (84), 29 states have return successors, (83), 80 states have call predecessors, (83), 81 states have call successors, (83) [2025-03-08 05:33:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 761 transitions. [2025-03-08 05:33:31,132 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 761 transitions. Word has length 147 [2025-03-08 05:33:31,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:31,132 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 761 transitions. [2025-03-08 05:33:31,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:33:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 761 transitions. [2025-03-08 05:33:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 05:33:31,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:31,135 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:31,144 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:33:31,336 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:33:31,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:31,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:31,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1046185485, now seen corresponding path program 1 times [2025-03-08 05:33:31,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:31,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155388268] [2025-03-08 05:33:31,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:31,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:31,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:33:31,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:33:31,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:31,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:33:31,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:31,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155388268] [2025-03-08 05:33:31,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155388268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:31,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911880317] [2025-03-08 05:33:31,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:31,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:31,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:31,523 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:33:31,524 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:33:31,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:33:31,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:33:31,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:31,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:31,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:33:31,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:33:31,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:31,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911880317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:31,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:31,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:33:31,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874240396] [2025-03-08 05:33:31,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:31,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:31,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:31,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:31,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:33:31,825 INFO L87 Difference]: Start difference. First operand 494 states and 761 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:33:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:31,885 INFO L93 Difference]: Finished difference Result 977 states and 1511 transitions. [2025-03-08 05:33:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:31,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-03-08 05:33:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:31,889 INFO L225 Difference]: With dead ends: 977 [2025-03-08 05:33:31,889 INFO L226 Difference]: Without dead ends: 496 [2025-03-08 05:33:31,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 146 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:33:31,891 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 2 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2511 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:33:31,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2511 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-08 05:33:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-08 05:33:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 381 states have (on average 1.5616797900262467) internal successors, (595), 388 states have internal predecessors, (595), 84 states have call successors, (84), 29 states have call predecessors, (84), 30 states have return successors, (88), 80 states have call predecessors, (88), 81 states have call successors, (88) [2025-03-08 05:33:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 767 transitions. [2025-03-08 05:33:31,908 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 767 transitions. Word has length 148 [2025-03-08 05:33:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:31,908 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 767 transitions. [2025-03-08 05:33:31,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:33:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 767 transitions. [2025-03-08 05:33:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 05:33:31,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:31,911 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:31,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:33:32,111 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:33:32,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:32,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash 699140570, now seen corresponding path program 1 times [2025-03-08 05:33:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:32,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133867108] [2025-03-08 05:33:32,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:32,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:32,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 05:33:32,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 05:33:32,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:32,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 05:33:32,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:32,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133867108] [2025-03-08 05:33:32,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133867108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:32,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:32,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:33:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625826632] [2025-03-08 05:33:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:32,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:32,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:32,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:32,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:33:32,281 INFO L87 Difference]: Start difference. First operand 496 states and 767 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-08 05:33:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:32,321 INFO L93 Difference]: Finished difference Result 969 states and 1502 transitions. [2025-03-08 05:33:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:32,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 168 [2025-03-08 05:33:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:32,325 INFO L225 Difference]: With dead ends: 969 [2025-03-08 05:33:32,325 INFO L226 Difference]: Without dead ends: 496 [2025-03-08 05:33:32,327 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:33:32,327 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 2 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2529 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:33:32,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2529 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-08 05:33:32,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-08 05:33:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 381 states have (on average 1.5616797900262467) internal successors, (595), 388 states have internal predecessors, (595), 84 states have call successors, (84), 29 states have call predecessors, (84), 30 states have return successors, (87), 80 states have call predecessors, (87), 81 states have call successors, (87) [2025-03-08 05:33:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 766 transitions. [2025-03-08 05:33:32,354 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 766 transitions. Word has length 168 [2025-03-08 05:33:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:32,354 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 766 transitions. [2025-03-08 05:33:32,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-08 05:33:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 766 transitions. [2025-03-08 05:33:32,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 05:33:32,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:32,358 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:32,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:33:32,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:32,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1367895852, now seen corresponding path program 1 times [2025-03-08 05:33:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:32,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818790513] [2025-03-08 05:33:32,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:32,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:32,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 05:33:32,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 05:33:32,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:32,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:33:32,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:32,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818790513] [2025-03-08 05:33:32,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818790513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:32,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:32,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:33:32,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245518509] [2025-03-08 05:33:32,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:32,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:32,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:32,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:32,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:33:32,523 INFO L87 Difference]: Start difference. First operand 496 states and 766 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:33:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:32,566 INFO L93 Difference]: Finished difference Result 971 states and 1505 transitions. [2025-03-08 05:33:32,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:32,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 150 [2025-03-08 05:33:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:32,571 INFO L225 Difference]: With dead ends: 971 [2025-03-08 05:33:32,571 INFO L226 Difference]: Without dead ends: 498 [2025-03-08 05:33:32,574 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:33:32,575 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 1 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2532 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:33:32,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2532 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-08 05:33:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-03-08 05:33:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 382 states have (on average 1.5602094240837696) internal successors, (596), 390 states have internal predecessors, (596), 84 states have call successors, (84), 29 states have call predecessors, (84), 31 states have return successors, (89), 80 states have call predecessors, (89), 81 states have call successors, (89) [2025-03-08 05:33:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 769 transitions. [2025-03-08 05:33:32,593 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 769 transitions. Word has length 150 [2025-03-08 05:33:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:32,594 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 769 transitions. [2025-03-08 05:33:32,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:33:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 769 transitions. [2025-03-08 05:33:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 05:33:32,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:32,597 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:32,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:33:32,598 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:32,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:32,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1001079674, now seen corresponding path program 1 times [2025-03-08 05:33:32,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:32,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093989809] [2025-03-08 05:33:32,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:32,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:32,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 05:33:32,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 05:33:32,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:32,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:33:32,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:32,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093989809] [2025-03-08 05:33:32,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093989809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:32,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:32,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:33:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696980584] [2025-03-08 05:33:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:32,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:33:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:32,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:33:32,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:33:32,737 INFO L87 Difference]: Start difference. First operand 498 states and 769 transitions. Second operand has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 05:33:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:32,867 INFO L93 Difference]: Finished difference Result 973 states and 1504 transitions. [2025-03-08 05:33:32,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:33:32,868 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 151 [2025-03-08 05:33:32,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:32,872 INFO L225 Difference]: With dead ends: 973 [2025-03-08 05:33:32,872 INFO L226 Difference]: Without dead ends: 500 [2025-03-08 05:33:32,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:33:32,874 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 7 mSDsluCounter, 3727 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4353 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:32,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4353 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:33:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-08 05:33:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-03-08 05:33:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 384 states have (on average 1.5572916666666667) internal successors, (598), 391 states have internal predecessors, (598), 84 states have call successors, (84), 30 states have call predecessors, (84), 31 states have return successors, (88), 80 states have call predecessors, (88), 81 states have call successors, (88) [2025-03-08 05:33:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 770 transitions. [2025-03-08 05:33:32,894 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 770 transitions. Word has length 151 [2025-03-08 05:33:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:32,894 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 770 transitions. [2025-03-08 05:33:32,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 05:33:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 770 transitions. [2025-03-08 05:33:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 05:33:32,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:32,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:32,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:33:32,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:32,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:32,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1668528055, now seen corresponding path program 1 times [2025-03-08 05:33:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879036892] [2025-03-08 05:33:32,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:32,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 05:33:32,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 05:33:32,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:32,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 05:33:33,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:33,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879036892] [2025-03-08 05:33:33,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879036892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:33,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:33,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:33:33,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658227860] [2025-03-08 05:33:33,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:33,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:33:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:33,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:33:33,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:33:33,053 INFO L87 Difference]: Start difference. First operand 500 states and 770 transitions. Second operand has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-08 05:33:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:33,172 INFO L93 Difference]: Finished difference Result 976 states and 1511 transitions. [2025-03-08 05:33:33,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:33:33,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 171 [2025-03-08 05:33:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:33,176 INFO L225 Difference]: With dead ends: 976 [2025-03-08 05:33:33,176 INFO L226 Difference]: Without dead ends: 503 [2025-03-08 05:33:33,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:33:33,178 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 5 mSDsluCounter, 3739 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4367 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:33,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4367 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:33:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-08 05:33:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-03-08 05:33:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 386 states have (on average 1.5544041450777202) internal successors, (600), 394 states have internal predecessors, (600), 84 states have call successors, (84), 30 states have call predecessors, (84), 32 states have return successors, (93), 80 states have call predecessors, (93), 81 states have call successors, (93) [2025-03-08 05:33:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 777 transitions. [2025-03-08 05:33:33,196 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 777 transitions. Word has length 171 [2025-03-08 05:33:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:33,196 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 777 transitions. [2025-03-08 05:33:33,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-08 05:33:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 777 transitions. [2025-03-08 05:33:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 05:33:33,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:33,198 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:33,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:33:33,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:33,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash -636950851, now seen corresponding path program 1 times [2025-03-08 05:33:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:33,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348988615] [2025-03-08 05:33:33,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:33,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 05:33:33,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 05:33:33,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:33,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:33:33,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:33,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348988615] [2025-03-08 05:33:33,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348988615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:33,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115531282] [2025-03-08 05:33:33,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:33,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:33,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:33,378 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:33:33,379 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:33:33,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 05:33:33,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 05:33:33,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:33,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:33,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:33:33,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:33:33,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:33:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:33:33,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115531282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:33:33,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:33:33,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:33:33,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893723822] [2025-03-08 05:33:33,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:33:33,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:33:33,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:33,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:33:33,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:33:33,764 INFO L87 Difference]: Start difference. First operand 503 states and 777 transitions. Second operand has 11 states, 10 states have (on average 14.4) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-08 05:33:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:34,337 INFO L93 Difference]: Finished difference Result 1408 states and 2276 transitions. [2025-03-08 05:33:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:33:34,337 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 14.4) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 153 [2025-03-08 05:33:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:34,343 INFO L225 Difference]: With dead ends: 1408 [2025-03-08 05:33:34,343 INFO L226 Difference]: Without dead ends: 936 [2025-03-08 05:33:34,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 303 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:33:34,345 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 1455 mSDsluCounter, 3895 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 4528 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:34,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 4528 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:33:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-08 05:33:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 912. [2025-03-08 05:33:34,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 716 states have (on average 1.6159217877094971) internal successors, (1157), 723 states have internal predecessors, (1157), 163 states have call successors, (163), 31 states have call predecessors, (163), 32 states have return successors, (182), 159 states have call predecessors, (182), 160 states have call successors, (182) [2025-03-08 05:33:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1502 transitions. [2025-03-08 05:33:34,382 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1502 transitions. Word has length 153 [2025-03-08 05:33:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:34,382 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1502 transitions. [2025-03-08 05:33:34,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 14.4) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-08 05:33:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1502 transitions. [2025-03-08 05:33:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 05:33:34,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:34,387 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:34,396 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:33:34,588 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:33:34,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:34,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:34,589 INFO L85 PathProgramCache]: Analyzing trace with hash -375765574, now seen corresponding path program 1 times [2025-03-08 05:33:34,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:34,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877723487] [2025-03-08 05:33:34,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:34,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:34,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 05:33:34,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 05:33:34,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:34,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:33:34,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:34,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877723487] [2025-03-08 05:33:34,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877723487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:34,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:34,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:34,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359472808] [2025-03-08 05:33:34,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:34,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:34,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:34,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:34,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:34,665 INFO L87 Difference]: Start difference. First operand 912 states and 1502 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:34,715 INFO L93 Difference]: Finished difference Result 2131 states and 3574 transitions. [2025-03-08 05:33:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:34,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 176 [2025-03-08 05:33:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:34,724 INFO L225 Difference]: With dead ends: 2131 [2025-03-08 05:33:34,724 INFO L226 Difference]: Without dead ends: 1298 [2025-03-08 05:33:34,727 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:33:34,728 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 131 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1283 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:33:34,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1283 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:34,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-08 05:33:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1290. [2025-03-08 05:33:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1015 states have (on average 1.6403940886699508) internal successors, (1665), 1022 states have internal predecessors, (1665), 242 states have call successors, (242), 31 states have call predecessors, (242), 32 states have return successors, (271), 238 states have call predecessors, (271), 239 states have call successors, (271) [2025-03-08 05:33:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 2178 transitions. [2025-03-08 05:33:34,804 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 2178 transitions. Word has length 176 [2025-03-08 05:33:34,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:34,804 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 2178 transitions. [2025-03-08 05:33:34,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:34,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 2178 transitions. [2025-03-08 05:33:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 05:33:34,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:34,811 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:34,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:33:34,812 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:34,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash 522048007, now seen corresponding path program 1 times [2025-03-08 05:33:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632193037] [2025-03-08 05:33:34,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:34,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:33:34,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:33:34,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:34,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:33:34,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:34,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632193037] [2025-03-08 05:33:34,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632193037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:34,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:34,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:34,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336327343] [2025-03-08 05:33:34,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:34,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:34,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:34,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:34,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:34,877 INFO L87 Difference]: Start difference. First operand 1290 states and 2178 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:33:34,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:34,945 INFO L93 Difference]: Finished difference Result 3077 states and 5239 transitions. [2025-03-08 05:33:34,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:34,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2025-03-08 05:33:34,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:34,958 INFO L225 Difference]: With dead ends: 3077 [2025-03-08 05:33:34,958 INFO L226 Difference]: Without dead ends: 1915 [2025-03-08 05:33:34,963 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:33:34,964 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 129 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1276 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:33:34,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1276 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:34,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2025-03-08 05:33:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1907. [2025-03-08 05:33:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1513 states have (on average 1.6543291473892927) internal successors, (2503), 1520 states have internal predecessors, (2503), 361 states have call successors, (361), 31 states have call predecessors, (361), 32 states have return successors, (390), 357 states have call predecessors, (390), 358 states have call successors, (390) [2025-03-08 05:33:35,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 3254 transitions. [2025-03-08 05:33:35,105 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 3254 transitions. Word has length 158 [2025-03-08 05:33:35,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:35,105 INFO L471 AbstractCegarLoop]: Abstraction has 1907 states and 3254 transitions. [2025-03-08 05:33:35,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:33:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 3254 transitions. [2025-03-08 05:33:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 05:33:35,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:35,127 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:35,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:33:35,127 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:35,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1108125177, now seen corresponding path program 1 times [2025-03-08 05:33:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:35,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11144699] [2025-03-08 05:33:35,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:35,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 05:33:35,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 05:33:35,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:35,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:33:35,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:35,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11144699] [2025-03-08 05:33:35,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11144699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:35,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:35,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:35,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719403193] [2025-03-08 05:33:35,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:35,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:35,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:35,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:35,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:35,233 INFO L87 Difference]: Start difference. First operand 1907 states and 3254 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:35,324 INFO L93 Difference]: Finished difference Result 4511 states and 7770 transitions. [2025-03-08 05:33:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:35,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2025-03-08 05:33:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:35,342 INFO L225 Difference]: With dead ends: 4511 [2025-03-08 05:33:35,343 INFO L226 Difference]: Without dead ends: 2860 [2025-03-08 05:33:35,350 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:33:35,351 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 127 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1271 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:33:35,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1271 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2025-03-08 05:33:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2852. [2025-03-08 05:33:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2296 states have (on average 1.6655052264808363) internal successors, (3824), 2303 states have internal predecessors, (3824), 523 states have call successors, (523), 31 states have call predecessors, (523), 32 states have return successors, (568), 519 states have call predecessors, (568), 520 states have call successors, (568) [2025-03-08 05:33:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4915 transitions. [2025-03-08 05:33:35,560 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4915 transitions. Word has length 178 [2025-03-08 05:33:35,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:35,561 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 4915 transitions. [2025-03-08 05:33:35,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4915 transitions. [2025-03-08 05:33:35,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 05:33:35,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:35,580 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:35,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:33:35,581 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:35,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1392367093, now seen corresponding path program 1 times [2025-03-08 05:33:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:35,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535657211] [2025-03-08 05:33:35,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:35,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 05:33:35,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 05:33:35,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:35,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:33:35,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:35,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535657211] [2025-03-08 05:33:35,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535657211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:35,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679129762] [2025-03-08 05:33:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:35,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:35,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:35,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:35,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:35,666 INFO L87 Difference]: Start difference. First operand 2852 states and 4915 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:35,804 INFO L93 Difference]: Finished difference Result 6773 states and 11771 transitions. [2025-03-08 05:33:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:35,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 179 [2025-03-08 05:33:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:35,835 INFO L225 Difference]: With dead ends: 6773 [2025-03-08 05:33:35,835 INFO L226 Difference]: Without dead ends: 4385 [2025-03-08 05:33:35,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:35,848 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 125 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1271 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:33:35,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1271 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4385 states. [2025-03-08 05:33:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4385 to 4377. [2025-03-08 05:33:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4377 states, 3576 states have (on average 1.6736577181208054) internal successors, (5985), 3583 states have internal predecessors, (5985), 768 states have call successors, (768), 31 states have call predecessors, (768), 32 states have return successors, (839), 764 states have call predecessors, (839), 765 states have call successors, (839) [2025-03-08 05:33:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4377 states to 4377 states and 7592 transitions. [2025-03-08 05:33:36,093 INFO L78 Accepts]: Start accepts. Automaton has 4377 states and 7592 transitions. Word has length 179 [2025-03-08 05:33:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:36,093 INFO L471 AbstractCegarLoop]: Abstraction has 4377 states and 7592 transitions. [2025-03-08 05:33:36,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4377 states and 7592 transitions. [2025-03-08 05:33:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 05:33:36,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:36,116 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:36,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:33:36,117 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:36,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:36,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1155729240, now seen corresponding path program 1 times [2025-03-08 05:33:36,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:36,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004343933] [2025-03-08 05:33:36,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:36,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:36,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 05:33:36,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 05:33:36,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:36,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:33:36,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004343933] [2025-03-08 05:33:36,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004343933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:36,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:36,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160634431] [2025-03-08 05:33:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:36,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:36,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:36,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:36,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:36,184 INFO L87 Difference]: Start difference. First operand 4377 states and 7592 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:36,386 INFO L93 Difference]: Finished difference Result 10811 states and 18867 transitions. [2025-03-08 05:33:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:36,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 180 [2025-03-08 05:33:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:36,464 INFO L225 Difference]: With dead ends: 10811 [2025-03-08 05:33:36,464 INFO L226 Difference]: Without dead ends: 7134 [2025-03-08 05:33:36,500 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:33:36,500 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 123 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1293 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:33:36,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1293 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7134 states. [2025-03-08 05:33:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7134 to 7126. [2025-03-08 05:33:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7126 states, 5832 states have (on average 1.6718106995884774) internal successors, (9750), 5839 states have internal predecessors, (9750), 1261 states have call successors, (1261), 31 states have call predecessors, (1261), 32 states have return successors, (1376), 1257 states have call predecessors, (1376), 1258 states have call successors, (1376) [2025-03-08 05:33:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7126 states to 7126 states and 12387 transitions. [2025-03-08 05:33:36,844 INFO L78 Accepts]: Start accepts. Automaton has 7126 states and 12387 transitions. Word has length 180 [2025-03-08 05:33:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:36,844 INFO L471 AbstractCegarLoop]: Abstraction has 7126 states and 12387 transitions. [2025-03-08 05:33:36,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:36,845 INFO L276 IsEmpty]: Start isEmpty. Operand 7126 states and 12387 transitions. [2025-03-08 05:33:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 05:33:36,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:36,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:36,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:33:36,878 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:36,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:36,878 INFO L85 PathProgramCache]: Analyzing trace with hash 649911109, now seen corresponding path program 1 times [2025-03-08 05:33:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:36,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674479279] [2025-03-08 05:33:36,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:36,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 05:33:36,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 05:33:36,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:36,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:33:36,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:36,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674479279] [2025-03-08 05:33:36,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674479279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:36,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:36,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:36,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956577761] [2025-03-08 05:33:36,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:36,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:36,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:36,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:36,979 INFO L87 Difference]: Start difference. First operand 7126 states and 12387 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:33:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:37,333 INFO L93 Difference]: Finished difference Result 17993 states and 31482 transitions. [2025-03-08 05:33:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:37,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 162 [2025-03-08 05:33:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:37,399 INFO L225 Difference]: With dead ends: 17993 [2025-03-08 05:33:37,399 INFO L226 Difference]: Without dead ends: 11947 [2025-03-08 05:33:37,428 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:33:37,428 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 121 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1276 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:33:37,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1276 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11947 states. [2025-03-08 05:33:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11947 to 11939. [2025-03-08 05:33:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11939 states, 9823 states have (on average 1.6731141199226305) internal successors, (16435), 9830 states have internal predecessors, (16435), 2083 states have call successors, (2083), 31 states have call predecessors, (2083), 32 states have return successors, (2276), 2079 states have call predecessors, (2276), 2080 states have call successors, (2276) [2025-03-08 05:33:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11939 states to 11939 states and 20794 transitions. [2025-03-08 05:33:37,969 INFO L78 Accepts]: Start accepts. Automaton has 11939 states and 20794 transitions. Word has length 162 [2025-03-08 05:33:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:37,969 INFO L471 AbstractCegarLoop]: Abstraction has 11939 states and 20794 transitions. [2025-03-08 05:33:37,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:33:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 11939 states and 20794 transitions. [2025-03-08 05:33:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 05:33:38,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:38,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:38,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:33:38,019 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:38,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:38,020 INFO L85 PathProgramCache]: Analyzing trace with hash -335682694, now seen corresponding path program 1 times [2025-03-08 05:33:38,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:38,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968388919] [2025-03-08 05:33:38,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:38,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:38,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 05:33:38,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 05:33:38,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:38,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:33:38,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:38,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968388919] [2025-03-08 05:33:38,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968388919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:38,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:38,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:38,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344025862] [2025-03-08 05:33:38,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:38,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:38,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:38,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:38,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:38,085 INFO L87 Difference]: Start difference. First operand 11939 states and 20794 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:33:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:38,487 INFO L93 Difference]: Finished difference Result 28511 states and 49621 transitions. [2025-03-08 05:33:38,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:38,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2025-03-08 05:33:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:38,571 INFO L225 Difference]: With dead ends: 28511 [2025-03-08 05:33:38,572 INFO L226 Difference]: Without dead ends: 18597 [2025-03-08 05:33:38,617 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:33:38,619 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 119 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1254 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:33:38,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1254 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18597 states. [2025-03-08 05:33:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18597 to 18589. [2025-03-08 05:33:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18589 states, 15270 states have (on average 1.6504256712508185) internal successors, (25202), 15277 states have internal predecessors, (25202), 3286 states have call successors, (3286), 31 states have call predecessors, (3286), 32 states have return successors, (3623), 3282 states have call predecessors, (3623), 3283 states have call successors, (3623) [2025-03-08 05:33:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 32111 transitions. [2025-03-08 05:33:39,606 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 32111 transitions. Word has length 163 [2025-03-08 05:33:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:39,606 INFO L471 AbstractCegarLoop]: Abstraction has 18589 states and 32111 transitions. [2025-03-08 05:33:39,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:33:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 32111 transitions. [2025-03-08 05:33:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 05:33:39,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:39,664 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:39,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:33:39,664 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:39,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:39,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1314185229, now seen corresponding path program 1 times [2025-03-08 05:33:39,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:39,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828927140] [2025-03-08 05:33:39,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:39,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:39,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 05:33:39,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:33:39,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:39,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:33:39,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:39,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828927140] [2025-03-08 05:33:39,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828927140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:39,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:39,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651026398] [2025-03-08 05:33:39,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:39,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:39,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:39,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:39,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:39,744 INFO L87 Difference]: Start difference. First operand 18589 states and 32111 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:40,460 INFO L93 Difference]: Finished difference Result 49108 states and 85164 transitions. [2025-03-08 05:33:40,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:40,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 183 [2025-03-08 05:33:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:40,580 INFO L225 Difference]: With dead ends: 49108 [2025-03-08 05:33:40,580 INFO L226 Difference]: Without dead ends: 33149 [2025-03-08 05:33:40,620 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:33:40,621 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 117 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1274 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:33:40,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1274 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:40,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33149 states. [2025-03-08 05:33:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33149 to 33141. [2025-03-08 05:33:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33141 states, 27372 states have (on average 1.647632617273126) internal successors, (45099), 27379 states have internal predecessors, (45099), 5736 states have call successors, (5736), 31 states have call predecessors, (5736), 32 states have return successors, (6347), 5732 states have call predecessors, (6347), 5733 states have call successors, (6347) [2025-03-08 05:33:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33141 states to 33141 states and 57182 transitions. [2025-03-08 05:33:41,759 INFO L78 Accepts]: Start accepts. Automaton has 33141 states and 57182 transitions. Word has length 183 [2025-03-08 05:33:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:41,759 INFO L471 AbstractCegarLoop]: Abstraction has 33141 states and 57182 transitions. [2025-03-08 05:33:41,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 33141 states and 57182 transitions. [2025-03-08 05:33:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 05:33:41,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:41,836 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:41,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:33:41,837 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:41,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:41,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1757851530, now seen corresponding path program 1 times [2025-03-08 05:33:41,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:41,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338774707] [2025-03-08 05:33:41,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:41,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:41,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 05:33:41,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 05:33:41,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:41,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:33:42,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:42,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338774707] [2025-03-08 05:33:42,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338774707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:42,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:42,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:42,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495959295] [2025-03-08 05:33:42,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:42,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:42,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:42,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:42,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:42,050 INFO L87 Difference]: Start difference. First operand 33141 states and 57182 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:43,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:43,936 INFO L93 Difference]: Finished difference Result 90365 states and 156416 transitions. [2025-03-08 05:33:43,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:43,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 184 [2025-03-08 05:33:43,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:44,207 INFO L225 Difference]: With dead ends: 90365 [2025-03-08 05:33:44,207 INFO L226 Difference]: Without dead ends: 60724 [2025-03-08 05:33:44,280 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:33:44,281 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 115 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1276 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:33:44,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1276 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:44,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60724 states. [2025-03-08 05:33:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60724 to 60716. [2025-03-08 05:33:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60716 states, 50434 states have (on average 1.6435737795931316) internal successors, (82892), 50441 states have internal predecessors, (82892), 10249 states have call successors, (10249), 31 states have call predecessors, (10249), 32 states have return successors, (11392), 10245 states have call predecessors, (11392), 10246 states have call successors, (11392) [2025-03-08 05:33:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60716 states to 60716 states and 104533 transitions. [2025-03-08 05:33:46,138 INFO L78 Accepts]: Start accepts. Automaton has 60716 states and 104533 transitions. Word has length 184 [2025-03-08 05:33:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:46,139 INFO L471 AbstractCegarLoop]: Abstraction has 60716 states and 104533 transitions. [2025-03-08 05:33:46,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 60716 states and 104533 transitions. [2025-03-08 05:33:46,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 05:33:46,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:46,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:46,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:33:46,738 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:46,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2040328413, now seen corresponding path program 1 times [2025-03-08 05:33:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:46,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328296457] [2025-03-08 05:33:46,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:46,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 05:33:46,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 05:33:46,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:46,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:33:46,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:46,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328296457] [2025-03-08 05:33:46,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328296457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:46,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:46,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:46,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533127951] [2025-03-08 05:33:46,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:46,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:46,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:46,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:46,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:46,814 INFO L87 Difference]: Start difference. First operand 60716 states and 104533 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:33:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:48,957 INFO L93 Difference]: Finished difference Result 113712 states and 196195 transitions. [2025-03-08 05:33:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:48,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 166 [2025-03-08 05:33:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:49,390 INFO L225 Difference]: With dead ends: 113712 [2025-03-08 05:33:49,390 INFO L226 Difference]: Without dead ends: 113476 [2025-03-08 05:33:49,445 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:33:49,446 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 110 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1288 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:33:49,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1288 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113476 states. [2025-03-08 05:33:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113476 to 113468. [2025-03-08 05:33:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113468 states, 94818 states have (on average 1.6382859794553777) internal successors, (155339), 94825 states have internal predecessors, (155339), 18617 states have call successors, (18617), 31 states have call predecessors, (18617), 32 states have return successors, (20806), 18613 states have call predecessors, (20806), 18614 states have call successors, (20806) [2025-03-08 05:33:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113468 states to 113468 states and 194762 transitions. [2025-03-08 05:33:53,404 INFO L78 Accepts]: Start accepts. Automaton has 113468 states and 194762 transitions. Word has length 166 [2025-03-08 05:33:53,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:53,404 INFO L471 AbstractCegarLoop]: Abstraction has 113468 states and 194762 transitions. [2025-03-08 05:33:53,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:33:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 113468 states and 194762 transitions. [2025-03-08 05:33:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 05:33:53,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:53,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:53,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:33:53,548 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash 807282773, now seen corresponding path program 1 times [2025-03-08 05:33:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:53,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693794450] [2025-03-08 05:33:53,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:53,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 05:33:53,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 05:33:53,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:53,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:33:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693794450] [2025-03-08 05:33:53,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693794450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:53,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:53,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:33:53,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944109703] [2025-03-08 05:33:53,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:53,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:33:53,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:53,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:33:53,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:33:53,674 INFO L87 Difference]: Start difference. First operand 113468 states and 194762 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:33:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:58,382 INFO L93 Difference]: Finished difference Result 218427 states and 376400 transitions. [2025-03-08 05:33:58,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:33:58,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 186 [2025-03-08 05:33:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:59,274 INFO L225 Difference]: With dead ends: 218427 [2025-03-08 05:33:59,274 INFO L226 Difference]: Without dead ends: 218199 [2025-03-08 05:33:59,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:33:59,379 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 588 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 3250 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:59,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 3250 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:33:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218199 states. [2025-03-08 05:34:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218199 to 218189. [2025-03-08 05:34:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218189 states, 182394 states have (on average 1.6413423687182693) internal successors, (299371), 182349 states have internal predecessors, (299371), 35734 states have call successors, (35734), 58 states have call predecessors, (35734), 60 states have return successors, (39015), 35785 states have call predecessors, (39015), 35730 states have call successors, (39015) [2025-03-08 05:34:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218189 states to 218189 states and 374120 transitions. [2025-03-08 05:34:07,025 INFO L78 Accepts]: Start accepts. Automaton has 218189 states and 374120 transitions. Word has length 186 [2025-03-08 05:34:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:07,026 INFO L471 AbstractCegarLoop]: Abstraction has 218189 states and 374120 transitions. [2025-03-08 05:34:07,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:34:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 218189 states and 374120 transitions. [2025-03-08 05:34:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 05:34:07,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:07,218 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:07,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:34:07,219 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:07,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:07,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1681618884, now seen corresponding path program 1 times [2025-03-08 05:34:07,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:07,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429808023] [2025-03-08 05:34:07,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:07,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:07,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:34:07,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:34:07,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:07,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 05:34:07,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:07,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429808023] [2025-03-08 05:34:07,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429808023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:07,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791224731] [2025-03-08 05:34:07,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:07,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:07,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:07,564 INFO L229 MonitoredProcess]: Starting monitored process 7 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:34:07,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:34:07,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:34:08,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:34:08,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:08,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:08,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:34:08,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:34:08,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:34:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 05:34:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791224731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:34:08,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:34:08,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-03-08 05:34:08,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655942737] [2025-03-08 05:34:08,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:34:08,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:34:08,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:08,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:34:08,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:34:08,566 INFO L87 Difference]: Start difference. First operand 218189 states and 374120 transitions. Second operand has 28 states, 26 states have (on average 9.76923076923077) internal successors, (254), 24 states have internal predecessors, (254), 9 states have call successors, (55), 8 states have call predecessors, (55), 12 states have return successors, (47), 11 states have call predecessors, (47), 9 states have call successors, (47)