./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec3_product30.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 bcbcb0270b2ee5ae38e5dd3a933d2995b5c0488c9590f16a6543c0c656cfb023 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:23:26,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:23:26,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:23:26,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:23:26,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:23:26,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:23:26,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:23:26,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:23:26,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:23:26,663 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:23:26,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:23:26,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:23:26,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:23:26,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:23:26,665 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:23:26,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:23:26,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:23:26,665 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:23:26,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:23:26,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:23:26,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:23:26,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:23:26,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:23:26,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:23:26,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:23:26,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:23:26,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:23:26,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:23:26,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:23:26,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:23:26,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:23:26,667 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 -> bcbcb0270b2ee5ae38e5dd3a933d2995b5c0488c9590f16a6543c0c656cfb023 [2025-03-03 14:23:26,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:23:26,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:23:26,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:23:26,897 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:23:26,897 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:23:26,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product30.cil.c [2025-03-03 14:23:28,007 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7abae7703/b0dae380fa0c4f239c98e4d1a7e4f9d0/FLAG77baa8641 [2025-03-03 14:23:28,295 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:23:28,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product30.cil.c [2025-03-03 14:23:28,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7abae7703/b0dae380fa0c4f239c98e4d1a7e4f9d0/FLAG77baa8641 [2025-03-03 14:23:28,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7abae7703/b0dae380fa0c4f239c98e4d1a7e4f9d0 [2025-03-03 14:23:28,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:23:28,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:23:28,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:23:28,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:23:28,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:23:28,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:23:28" (1/1) ... [2025-03-03 14:23:28,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5d3808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:28, skipping insertion in model container [2025-03-03 14:23:28,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:23:28" (1/1) ... [2025-03-03 14:23:28,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:23:28,783 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_product30.cil.c[5243,5256] [2025-03-03 14:23:29,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:23:29,017 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:23:29,023 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-03-03 14:23:29,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [208] [2025-03-03 14:23:29,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [217] [2025-03-03 14:23:29,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [619] [2025-03-03 14:23:29,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [985] [2025-03-03 14:23:29,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1288] [2025-03-03 14:23:29,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1504] [2025-03-03 14:23:29,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1539] [2025-03-03 14:23:29,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [1903] [2025-03-03 14:23:29,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1961] [2025-03-03 14:23:29,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [3028] [2025-03-03 14:23:29,033 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_product30.cil.c[5243,5256] [2025-03-03 14:23:29,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:23:29,130 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:23:29,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29 WrapperNode [2025-03-03 14:23:29,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:23:29,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:23:29,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:23:29,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:23:29,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (1/1) ... [2025-03-03 14:23:29,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (1/1) ... [2025-03-03 14:23:29,192 INFO L138 Inliner]: procedures = 132, calls = 211, calls flagged for inlining = 60, calls inlined = 50, statements flattened = 940 [2025-03-03 14:23:29,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:23:29,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:23:29,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:23:29,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:23:29,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (1/1) ... [2025-03-03 14:23:29,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (1/1) ... [2025-03-03 14:23:29,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (1/1) ... [2025-03-03 14:23:29,234 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:23:29,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (1/1) ... [2025-03-03 14:23:29,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (1/1) ... [2025-03-03 14:23:29,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (1/1) ... [2025-03-03 14:23:29,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (1/1) ... [2025-03-03 14:23:29,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (1/1) ... [2025-03-03 14:23:29,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (1/1) ... [2025-03-03 14:23:29,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:23:29,277 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:23:29,277 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:23:29,277 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:23:29,278 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (1/1) ... [2025-03-03 14:23:29,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:23:29,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:29,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:23:29,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:23:29,328 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:23:29,329 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:23:29,329 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:23:29,329 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:23:29,329 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:23:29,329 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:23:29,329 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:23:29,329 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:23:29,329 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:23:29,330 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:23:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:23:29,330 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:23:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:23:29,330 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:23:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:23:29,330 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:23:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:23:29,330 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:23:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:23:29,331 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:23:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:23:29,331 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:23:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:23:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:23:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:23:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:23:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:23:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:23:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:23:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:23:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:23:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:23:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:23:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:23:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:23:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:23:29,333 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:23:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:23:29,334 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:23:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:23:29,334 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:23:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:23:29,334 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:23:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:23:29,334 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:23:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:23:29,334 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:23:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:23:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:23:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:23:29,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:23:29,335 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:23:29,335 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:23:29,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:23:29,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:23:29,502 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:23:29,506 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:23:29,737 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2523-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~34#1; [2025-03-03 14:23:29,737 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3005-1: getClientId_#res#1 := getClientId_~retValue_acc~42#1; [2025-03-03 14:23:29,743 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L526: #res := ~retValue_acc~12; [2025-03-03 14:23:29,758 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1800: #res := ~retValue_acc~25; [2025-03-03 14:23:29,792 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~36#1; [2025-03-03 14:23:29,793 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2662: #res#1 := ~retValue_acc~37#1; [2025-03-03 14:23:29,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886: #res := ~retValue_acc~40; [2025-03-03 14:23:29,820 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2570: #res := ~retValue_acc~35; [2025-03-03 14:23:29,831 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L205-1: createEmail_#res#1 := createEmail_~retValue_acc~3#1; [2025-03-03 14:23:29,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L452: #res := ~retValue_acc~10; [2025-03-03 14:23:29,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: #res := ~retValue_acc~11; [2025-03-03 14:23:29,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: #res := ~retValue_acc~13; [2025-03-03 14:23:29,889 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L337: #res := ~retValue_acc~7; [2025-03-03 14:23:30,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1757-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~22#1; [2025-03-03 14:23:30,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1766-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~23#1; [2025-03-03 14:23:30,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1775-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~24#1; [2025-03-03 14:23:30,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2832-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~39#1; [2025-03-03 14:23:30,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2725-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~38#1; [2025-03-03 14:23:30,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1536-1: valid_product_#res#1 := valid_product_~retValue_acc~20#1; [2025-03-03 14:23:30,115 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L300: #res := ~retValue_acc~6; [2025-03-03 14:23:30,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L161-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~0#1; [2025-03-03 14:23:30,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: #res#1 := ~retValue_acc~1#1; [2025-03-03 14:23:30,212 INFO L? ?]: Removed 436 outVars from TransFormulas that were not future-live. [2025-03-03 14:23:30,213 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:23:30,224 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:23:30,224 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:23:30,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:23:30 BoogieIcfgContainer [2025-03-03 14:23:30,224 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:23:30,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:23:30,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:23:30,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:23:30,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:23:28" (1/3) ... [2025-03-03 14:23:30,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482465e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:23:30, skipping insertion in model container [2025-03-03 14:23:30,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:29" (2/3) ... [2025-03-03 14:23:30,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482465e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:23:30, skipping insertion in model container [2025-03-03 14:23:30,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:23:30" (3/3) ... [2025-03-03 14:23:30,232 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product30.cil.c [2025-03-03 14:23:30,243 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:23:30,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product30.cil.c that has 25 procedures, 357 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:23:30,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:23:30,302 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;@156f55d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:23:30,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:23:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 273 states have (on average 1.5091575091575091) internal successors, (412), 279 states have internal predecessors, (412), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 14:23:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:23:30,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:30,322 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] [2025-03-03 14:23:30,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:30,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:30,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1226862741, now seen corresponding path program 1 times [2025-03-03 14:23:30,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:30,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596596797] [2025-03-03 14:23:30,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:30,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:30,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:23:30,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:23:30,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:30,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:31,002 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-03 14:23:31,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596596797] [2025-03-03 14:23:31,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596596797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382391335] [2025-03-03 14:23:31,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:31,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:31,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:31,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:31,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:23:31,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:23:31,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:23:31,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:31,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:31,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:23:31,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:31,306 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-03 14:23:31,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382391335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:31,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:31,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:23:31,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424841011] [2025-03-03 14:23:31,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:31,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:23:31,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:31,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:23:31,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:31,340 INFO L87 Difference]: Start difference. First operand has 357 states, 273 states have (on average 1.5091575091575091) internal successors, (412), 279 states have internal predecessors, (412), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:31,384 INFO L93 Difference]: Finished difference Result 560 states and 812 transitions. [2025-03-03 14:23:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:23:31,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2025-03-03 14:23:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:31,395 INFO L225 Difference]: With dead ends: 560 [2025-03-03 14:23:31,396 INFO L226 Difference]: Without dead ends: 349 [2025-03-03 14:23:31,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:31,403 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:31,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-03 14:23:31,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-03-03 14:23:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 267 states have (on average 1.5056179775280898) internal successors, (402), 271 states have internal predecessors, (402), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-03 14:23:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 515 transitions. [2025-03-03 14:23:31,469 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 515 transitions. Word has length 130 [2025-03-03 14:23:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:31,470 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 515 transitions. [2025-03-03 14:23:31,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 515 transitions. [2025-03-03 14:23:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:23:31,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:31,480 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] [2025-03-03 14:23:31,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:23:31,680 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-03 14:23:31,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:31,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash 952585319, now seen corresponding path program 1 times [2025-03-03 14:23:31,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:31,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298634302] [2025-03-03 14:23:31,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:31,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:31,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:23:31,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:23:31,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:31,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:31,902 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-03 14:23:31,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:31,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298634302] [2025-03-03 14:23:31,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298634302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:31,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858104735] [2025-03-03 14:23:31,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:31,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:31,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:31,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:31,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:23:32,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:23:32,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:23:32,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:32,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:32,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:23:32,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:32,222 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-03 14:23:32,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:32,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858104735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:32,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:32,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:23:32,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84499184] [2025-03-03 14:23:32,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:32,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:32,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:32,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:32,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:23:32,224 INFO L87 Difference]: Start difference. First operand 349 states and 515 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:32,264 INFO L93 Difference]: Finished difference Result 548 states and 789 transitions. [2025-03-03 14:23:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:32,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-03-03 14:23:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:32,268 INFO L225 Difference]: With dead ends: 548 [2025-03-03 14:23:32,271 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 14:23:32,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 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-03 14:23:32,273 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 0 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:32,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1026 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 14:23:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-03 14:23:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 269 states have (on average 1.5018587360594795) internal successors, (404), 273 states have internal predecessors, (404), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-03 14:23:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 517 transitions. [2025-03-03 14:23:32,302 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 517 transitions. Word has length 131 [2025-03-03 14:23:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:32,303 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 517 transitions. [2025-03-03 14:23:32,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 517 transitions. [2025-03-03 14:23:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:23:32,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:32,305 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 14:23:32,313 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-03 14:23:32,506 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-03 14:23:32,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:32,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:32,507 INFO L85 PathProgramCache]: Analyzing trace with hash 688258069, now seen corresponding path program 1 times [2025-03-03 14:23:32,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:32,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628360824] [2025-03-03 14:23:32,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:32,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:32,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:23:32,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:23:32,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:32,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:23:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:32,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628360824] [2025-03-03 14:23:32,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628360824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:32,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622170446] [2025-03-03 14:23:32,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:32,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:32,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:32,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:32,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:23:32,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:23:33,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:23:33,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:33,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:33,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 1182 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:23:33,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 14:23:33,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:33,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622170446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:33,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:33,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:23:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423389379] [2025-03-03 14:23:33,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:33,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:33,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:33,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:33,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:23:33,067 INFO L87 Difference]: Start difference. First operand 351 states and 517 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:33,090 INFO L93 Difference]: Finished difference Result 731 states and 1092 transitions. [2025-03-03 14:23:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:33,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-03 14:23:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:33,095 INFO L225 Difference]: With dead ends: 731 [2025-03-03 14:23:33,096 INFO L226 Difference]: Without dead ends: 407 [2025-03-03 14:23:33,097 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-03 14:23:33,098 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 107 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:33,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1001 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-03 14:23:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 399. [2025-03-03 14:23:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 306 states have (on average 1.5196078431372548) internal successors, (465), 310 states have internal predecessors, (465), 69 states have call successors, (69), 24 states have call predecessors, (69), 23 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 14:23:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 600 transitions. [2025-03-03 14:23:33,124 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 600 transitions. Word has length 139 [2025-03-03 14:23:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:33,125 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 600 transitions. [2025-03-03 14:23:33,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 600 transitions. [2025-03-03 14:23:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:23:33,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:33,128 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 14:23:33,136 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-03 14:23:33,329 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-03 14:23:33,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:33,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1982396867, now seen corresponding path program 1 times [2025-03-03 14:23:33,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:33,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571724377] [2025-03-03 14:23:33,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:33,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:33,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:23:33,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:23:33,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:33,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:23:33,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:33,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571724377] [2025-03-03 14:23:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571724377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:33,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450804821] [2025-03-03 14:23:33,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:33,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:33,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:33,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:33,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:23:33,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:23:33,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:23:33,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:33,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:33,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:23:33,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:23:33,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:33,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450804821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:33,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:33,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:23:33,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907808069] [2025-03-03 14:23:33,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:33,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:33,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:33,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:33,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:33,888 INFO L87 Difference]: Start difference. First operand 399 states and 600 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:23:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:33,955 INFO L93 Difference]: Finished difference Result 789 states and 1190 transitions. [2025-03-03 14:23:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:33,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 140 [2025-03-03 14:23:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:33,960 INFO L225 Difference]: With dead ends: 789 [2025-03-03 14:23:33,961 INFO L226 Difference]: Without dead ends: 401 [2025-03-03 14:23:33,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 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-03 14:23:33,962 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 2 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2017 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-03 14:23:33,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2017 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-03 14:23:33,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-03-03 14:23:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 307 states have (on average 1.517915309446254) internal successors, (466), 312 states have internal predecessors, (466), 69 states have call successors, (69), 24 states have call predecessors, (69), 24 states have return successors, (68), 66 states have call predecessors, (68), 66 states have call successors, (68) [2025-03-03 14:23:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 603 transitions. [2025-03-03 14:23:33,976 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 603 transitions. Word has length 140 [2025-03-03 14:23:33,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:33,976 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 603 transitions. [2025-03-03 14:23:33,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:23:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 603 transitions. [2025-03-03 14:23:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 14:23:33,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:33,981 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:23:33,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:23:34,182 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-03 14:23:34,182 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:34,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:34,183 INFO L85 PathProgramCache]: Analyzing trace with hash -859708086, now seen corresponding path program 1 times [2025-03-03 14:23:34,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:34,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911052007] [2025-03-03 14:23:34,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:34,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:34,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:23:34,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:23:34,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:34,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:23:34,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:34,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911052007] [2025-03-03 14:23:34,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911052007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:34,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216013669] [2025-03-03 14:23:34,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:34,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:34,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:34,341 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-03 14:23:34,343 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-03 14:23:34,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:23:34,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:23:34,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:34,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:34,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:23:34,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:23:34,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:34,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216013669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:34,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:34,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:23:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613507018] [2025-03-03 14:23:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:34,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:34,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:34,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:34,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:34,650 INFO L87 Difference]: Start difference. First operand 401 states and 603 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:23:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:34,718 INFO L93 Difference]: Finished difference Result 791 states and 1195 transitions. [2025-03-03 14:23:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:34,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 141 [2025-03-03 14:23:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:34,721 INFO L225 Difference]: With dead ends: 791 [2025-03-03 14:23:34,721 INFO L226 Difference]: Without dead ends: 403 [2025-03-03 14:23:34,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 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-03 14:23:34,726 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 2 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2003 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-03 14:23:34,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2003 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-03 14:23:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-03 14:23:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 308 states have (on average 1.5162337662337662) internal successors, (467), 314 states have internal predecessors, (467), 69 states have call successors, (69), 24 states have call predecessors, (69), 25 states have return successors, (73), 66 states have call predecessors, (73), 66 states have call successors, (73) [2025-03-03 14:23:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 609 transitions. [2025-03-03 14:23:34,746 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 609 transitions. Word has length 141 [2025-03-03 14:23:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:34,746 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 609 transitions. [2025-03-03 14:23:34,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:23:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 609 transitions. [2025-03-03 14:23:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 14:23:34,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:34,750 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] [2025-03-03 14:23:34,758 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-03 14:23:34,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:34,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:34,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:34,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1357004912, now seen corresponding path program 1 times [2025-03-03 14:23:34,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:34,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929101696] [2025-03-03 14:23:34,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:34,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:34,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:23:34,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:23:34,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:34,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:23:35,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:35,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929101696] [2025-03-03 14:23:35,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929101696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:35,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:35,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:23:35,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102119758] [2025-03-03 14:23:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:35,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:35,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:35,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:35,106 INFO L87 Difference]: Start difference. First operand 403 states and 609 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:23:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:35,149 INFO L93 Difference]: Finished difference Result 783 states and 1186 transitions. [2025-03-03 14:23:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 142 [2025-03-03 14:23:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:35,152 INFO L225 Difference]: With dead ends: 783 [2025-03-03 14:23:35,153 INFO L226 Difference]: Without dead ends: 403 [2025-03-03 14:23:35,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:35,156 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 2 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2021 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-03 14:23:35,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2021 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-03 14:23:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-03 14:23:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 308 states have (on average 1.5162337662337662) internal successors, (467), 314 states have internal predecessors, (467), 69 states have call successors, (69), 24 states have call predecessors, (69), 25 states have return successors, (72), 66 states have call predecessors, (72), 66 states have call successors, (72) [2025-03-03 14:23:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 608 transitions. [2025-03-03 14:23:35,183 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 608 transitions. Word has length 142 [2025-03-03 14:23:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:35,183 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 608 transitions. [2025-03-03 14:23:35,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:23:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 608 transitions. [2025-03-03 14:23:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:23:35,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:35,186 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, 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] [2025-03-03 14:23:35,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:23:35,187 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:35,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:35,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1068911813, now seen corresponding path program 2 times [2025-03-03 14:23:35,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:35,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618421185] [2025-03-03 14:23:35,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:23:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:35,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-03 14:23:35,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 143 statements. [2025-03-03 14:23:35,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:23:35,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:23:35,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:35,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618421185] [2025-03-03 14:23:35,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618421185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:35,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:35,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:23:35,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162893555] [2025-03-03 14:23:35,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:35,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:23:35,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:35,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:23:35,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:35,340 INFO L87 Difference]: Start difference. First operand 403 states and 608 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:23:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:35,737 INFO L93 Difference]: Finished difference Result 1047 states and 1567 transitions. [2025-03-03 14:23:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:23:35,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 143 [2025-03-03 14:23:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:35,742 INFO L225 Difference]: With dead ends: 1047 [2025-03-03 14:23:35,743 INFO L226 Difference]: Without dead ends: 858 [2025-03-03 14:23:35,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:23:35,744 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 581 mSDsluCounter, 2887 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 3399 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:35,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 3399 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:23:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-03-03 14:23:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 785. [2025-03-03 14:23:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 605 states have (on average 1.5256198347107437) internal successors, (923), 613 states have internal predecessors, (923), 130 states have call successors, (130), 47 states have call predecessors, (130), 49 states have return successors, (141), 128 states have call predecessors, (141), 126 states have call successors, (141) [2025-03-03 14:23:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1194 transitions. [2025-03-03 14:23:35,779 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1194 transitions. Word has length 143 [2025-03-03 14:23:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:35,780 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1194 transitions. [2025-03-03 14:23:35,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:23:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1194 transitions. [2025-03-03 14:23:35,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:23:35,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:35,783 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] [2025-03-03 14:23:35,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:23:35,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:35,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:35,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1968993452, now seen corresponding path program 1 times [2025-03-03 14:23:35,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:35,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753664923] [2025-03-03 14:23:35,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:35,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:35,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 14:23:35,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:23:35,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:35,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:23:35,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:35,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753664923] [2025-03-03 14:23:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753664923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:35,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:35,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:23:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563434427] [2025-03-03 14:23:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:35,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:35,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:35,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:35,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:35,932 INFO L87 Difference]: Start difference. First operand 785 states and 1194 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:23:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:35,978 INFO L93 Difference]: Finished difference Result 1549 states and 2361 transitions. [2025-03-03 14:23:35,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:35,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 144 [2025-03-03 14:23:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:35,983 INFO L225 Difference]: With dead ends: 1549 [2025-03-03 14:23:35,983 INFO L226 Difference]: Without dead ends: 787 [2025-03-03 14:23:35,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:35,986 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 1 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2024 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-03 14:23:35,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2024 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-03-03 14:23:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 787. [2025-03-03 14:23:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 606 states have (on average 1.5247524752475248) internal successors, (924), 615 states have internal predecessors, (924), 130 states have call successors, (130), 47 states have call predecessors, (130), 50 states have return successors, (143), 128 states have call predecessors, (143), 126 states have call successors, (143) [2025-03-03 14:23:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1197 transitions. [2025-03-03 14:23:36,014 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1197 transitions. Word has length 144 [2025-03-03 14:23:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:36,015 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1197 transitions. [2025-03-03 14:23:36,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:23:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1197 transitions. [2025-03-03 14:23:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 14:23:36,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:36,018 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] [2025-03-03 14:23:36,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:23:36,018 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:36,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:36,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1265645786, now seen corresponding path program 1 times [2025-03-03 14:23:36,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503853653] [2025-03-03 14:23:36,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:36,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:23:36,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:23:36,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:36,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:36,158 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:23:36,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:36,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503853653] [2025-03-03 14:23:36,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503853653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:36,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:36,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:23:36,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174580236] [2025-03-03 14:23:36,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:36,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:23:36,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:36,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:23:36,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:36,160 INFO L87 Difference]: Start difference. First operand 787 states and 1197 transitions. Second operand has 8 states, 7 states have (on average 13.0) internal successors, (91), 8 states have internal predecessors, (91), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:23:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:36,268 INFO L93 Difference]: Finished difference Result 1165 states and 1770 transitions. [2025-03-03 14:23:36,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:23:36,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.0) internal successors, (91), 8 states have internal predecessors, (91), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 145 [2025-03-03 14:23:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:36,272 INFO L225 Difference]: With dead ends: 1165 [2025-03-03 14:23:36,272 INFO L226 Difference]: Without dead ends: 407 [2025-03-03 14:23:36,274 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-03 14:23:36,274 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 7 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3464 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-03 14:23:36,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3464 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-03 14:23:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-03-03 14:23:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 311 states have (on average 1.5112540192926045) internal successors, (470), 317 states have internal predecessors, (470), 69 states have call successors, (69), 25 states have call predecessors, (69), 26 states have return successors, (73), 66 states have call predecessors, (73), 66 states have call successors, (73) [2025-03-03 14:23:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2025-03-03 14:23:36,288 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 145 [2025-03-03 14:23:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:36,289 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2025-03-03 14:23:36,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.0) internal successors, (91), 8 states have internal predecessors, (91), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:23:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2025-03-03 14:23:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 14:23:36,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:36,291 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, 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] [2025-03-03 14:23:36,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:23:36,291 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:36,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:36,292 INFO L85 PathProgramCache]: Analyzing trace with hash -350578291, now seen corresponding path program 1 times [2025-03-03 14:23:36,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:36,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964484300] [2025-03-03 14:23:36,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:36,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:23:36,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:23:36,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:36,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:23:36,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964484300] [2025-03-03 14:23:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964484300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:36,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:36,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:23:36,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121256992] [2025-03-03 14:23:36,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:36,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:23:36,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:36,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:23:36,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:36,443 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:23:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:36,561 INFO L93 Difference]: Finished difference Result 790 states and 1195 transitions. [2025-03-03 14:23:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:23:36,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 145 [2025-03-03 14:23:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:36,564 INFO L225 Difference]: With dead ends: 790 [2025-03-03 14:23:36,564 INFO L226 Difference]: Without dead ends: 410 [2025-03-03 14:23:36,565 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-03 14:23:36,566 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 5 mSDsluCounter, 2977 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3478 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-03 14:23:36,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3478 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:36,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-03 14:23:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2025-03-03 14:23:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 313 states have (on average 1.5079872204472844) internal successors, (472), 320 states have internal predecessors, (472), 69 states have call successors, (69), 25 states have call predecessors, (69), 27 states have return successors, (78), 66 states have call predecessors, (78), 66 states have call successors, (78) [2025-03-03 14:23:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2025-03-03 14:23:36,582 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 145 [2025-03-03 14:23:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:36,582 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2025-03-03 14:23:36,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:23:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2025-03-03 14:23:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 14:23:36,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:36,584 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] [2025-03-03 14:23:36,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:23:36,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:36,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2048655510, now seen corresponding path program 1 times [2025-03-03 14:23:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:36,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775883667] [2025-03-03 14:23:36,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:36,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:36,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:23:36,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:23:36,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:36,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:23:36,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775883667] [2025-03-03 14:23:36,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775883667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965862477] [2025-03-03 14:23:36,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:36,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:36,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:36,742 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-03 14:23:36,743 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-03 14:23:36,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:23:36,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:23:36,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:36,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:36,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:23:36,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:23:37,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:23:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:23:37,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965862477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:23:37,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:23:37,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:23:37,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502944178] [2025-03-03 14:23:37,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:23:37,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:23:37,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:37,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:23:37,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:37,113 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand has 11 states, 10 states have (on average 14.1) internal successors, (141), 11 states have internal predecessors, (141), 4 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-03 14:23:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:37,606 INFO L93 Difference]: Finished difference Result 1137 states and 1800 transitions. [2025-03-03 14:23:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:23:37,606 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 14.1) internal successors, (141), 11 states have internal predecessors, (141), 4 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) Word has length 146 [2025-03-03 14:23:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:37,611 INFO L225 Difference]: With dead ends: 1137 [2025-03-03 14:23:37,611 INFO L226 Difference]: Without dead ends: 759 [2025-03-03 14:23:37,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 289 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-03 14:23:37,614 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 1317 mSDsluCounter, 2665 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 3166 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:37,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 3166 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:23:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-03-03 14:23:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 735. [2025-03-03 14:23:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 574 states have (on average 1.5679442508710801) internal successors, (900), 580 states have internal predecessors, (900), 133 states have call successors, (133), 26 states have call predecessors, (133), 27 states have return successors, (152), 130 states have call predecessors, (152), 130 states have call successors, (152) [2025-03-03 14:23:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1185 transitions. [2025-03-03 14:23:37,669 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1185 transitions. Word has length 146 [2025-03-03 14:23:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:37,670 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1185 transitions. [2025-03-03 14:23:37,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 14.1) internal successors, (141), 11 states have internal predecessors, (141), 4 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-03 14:23:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1185 transitions. [2025-03-03 14:23:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:23:37,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:37,675 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] [2025-03-03 14:23:37,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:23:37,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:37,876 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:37,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1243621589, now seen corresponding path program 1 times [2025-03-03 14:23:37,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:37,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759156726] [2025-03-03 14:23:37,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:37,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:37,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:23:37,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:23:37,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:37,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:37,927 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-03 14:23:37,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:37,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759156726] [2025-03-03 14:23:37,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759156726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:37,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:37,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:37,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826452233] [2025-03-03 14:23:37,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:37,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:37,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:37,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:37,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:37,928 INFO L87 Difference]: Start difference. First operand 735 states and 1185 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:37,960 INFO L93 Difference]: Finished difference Result 1692 states and 2780 transitions. [2025-03-03 14:23:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:37,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2025-03-03 14:23:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:37,966 INFO L225 Difference]: With dead ends: 1692 [2025-03-03 14:23:37,966 INFO L226 Difference]: Without dead ends: 1038 [2025-03-03 14:23:37,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:37,969 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 104 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:37,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1021 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2025-03-03 14:23:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1030. [2025-03-03 14:23:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 805 states have (on average 1.5900621118012421) internal successors, (1280), 811 states have internal predecessors, (1280), 197 states have call successors, (197), 26 states have call predecessors, (197), 27 states have return successors, (226), 194 states have call predecessors, (226), 194 states have call successors, (226) [2025-03-03 14:23:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1703 transitions. [2025-03-03 14:23:38,011 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1703 transitions. Word has length 149 [2025-03-03 14:23:38,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:38,011 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1703 transitions. [2025-03-03 14:23:38,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1703 transitions. [2025-03-03 14:23:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:23:38,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:38,017 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] [2025-03-03 14:23:38,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:23:38,017 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:38,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1158056440, now seen corresponding path program 1 times [2025-03-03 14:23:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37734655] [2025-03-03 14:23:38,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:38,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:23:38,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:23:38,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:38,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:38,067 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-03 14:23:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37734655] [2025-03-03 14:23:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37734655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:38,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:38,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:38,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601282069] [2025-03-03 14:23:38,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:38,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:38,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:38,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:38,068 INFO L87 Difference]: Start difference. First operand 1030 states and 1703 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:38,111 INFO L93 Difference]: Finished difference Result 2421 states and 4033 transitions. [2025-03-03 14:23:38,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:38,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-03-03 14:23:38,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:38,120 INFO L225 Difference]: With dead ends: 2421 [2025-03-03 14:23:38,120 INFO L226 Difference]: Without dead ends: 1523 [2025-03-03 14:23:38,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:38,124 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 102 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:38,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1024 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-03-03 14:23:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1515. [2025-03-03 14:23:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1195 states have (on average 1.601673640167364) internal successors, (1914), 1201 states have internal predecessors, (1914), 292 states have call successors, (292), 26 states have call predecessors, (292), 27 states have return successors, (321), 289 states have call predecessors, (321), 289 states have call successors, (321) [2025-03-03 14:23:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2527 transitions. [2025-03-03 14:23:38,189 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2527 transitions. Word has length 150 [2025-03-03 14:23:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:38,190 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2527 transitions. [2025-03-03 14:23:38,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2527 transitions. [2025-03-03 14:23:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:23:38,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:38,197 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-03 14:23:38,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:23:38,198 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:38,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:38,198 INFO L85 PathProgramCache]: Analyzing trace with hash -592782348, now seen corresponding path program 1 times [2025-03-03 14:23:38,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:38,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340491640] [2025-03-03 14:23:38,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:38,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:23:38,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:23:38,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:38,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:38,250 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-03 14:23:38,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:38,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340491640] [2025-03-03 14:23:38,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340491640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:38,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:38,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:38,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106186446] [2025-03-03 14:23:38,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:38,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:38,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:38,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:38,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:38,252 INFO L87 Difference]: Start difference. First operand 1515 states and 2527 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:38,339 INFO L93 Difference]: Finished difference Result 3505 states and 5899 transitions. [2025-03-03 14:23:38,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:38,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2025-03-03 14:23:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:38,351 INFO L225 Difference]: With dead ends: 3505 [2025-03-03 14:23:38,351 INFO L226 Difference]: Without dead ends: 2254 [2025-03-03 14:23:38,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:38,355 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 100 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:38,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1017 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2025-03-03 14:23:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2246. [2025-03-03 14:23:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 1803 states have (on average 1.6106489184692179) internal successors, (2904), 1809 states have internal predecessors, (2904), 415 states have call successors, (415), 26 states have call predecessors, (415), 27 states have return successors, (460), 412 states have call predecessors, (460), 412 states have call successors, (460) [2025-03-03 14:23:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3779 transitions. [2025-03-03 14:23:38,448 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3779 transitions. Word has length 151 [2025-03-03 14:23:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:38,449 INFO L471 AbstractCegarLoop]: Abstraction has 2246 states and 3779 transitions. [2025-03-03 14:23:38,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3779 transitions. [2025-03-03 14:23:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 14:23:38,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:38,460 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] [2025-03-03 14:23:38,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:23:38,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:38,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1115463801, now seen corresponding path program 1 times [2025-03-03 14:23:38,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:38,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005140891] [2025-03-03 14:23:38,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:38,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:38,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 14:23:38,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 14:23:38,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:38,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:38,508 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-03 14:23:38,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005140891] [2025-03-03 14:23:38,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005140891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:38,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:38,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:38,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550009566] [2025-03-03 14:23:38,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:38,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:38,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:38,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:38,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:38,510 INFO L87 Difference]: Start difference. First operand 2246 states and 3779 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:38,596 INFO L93 Difference]: Finished difference Result 5183 states and 8791 transitions. [2025-03-03 14:23:38,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:38,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2025-03-03 14:23:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:38,615 INFO L225 Difference]: With dead ends: 5183 [2025-03-03 14:23:38,615 INFO L226 Difference]: Without dead ends: 3416 [2025-03-03 14:23:38,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:38,624 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 98 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:38,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1017 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2025-03-03 14:23:38,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3408. [2025-03-03 14:23:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3408 states, 2786 states have (on average 1.6166547020818378) internal successors, (4504), 2792 states have internal predecessors, (4504), 594 states have call successors, (594), 26 states have call predecessors, (594), 27 states have return successors, (665), 591 states have call predecessors, (665), 591 states have call successors, (665) [2025-03-03 14:23:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 3408 states and 5763 transitions. [2025-03-03 14:23:38,800 INFO L78 Accepts]: Start accepts. Automaton has 3408 states and 5763 transitions. Word has length 152 [2025-03-03 14:23:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:38,801 INFO L471 AbstractCegarLoop]: Abstraction has 3408 states and 5763 transitions. [2025-03-03 14:23:38,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 5763 transitions. [2025-03-03 14:23:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 14:23:38,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:38,818 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-03 14:23:38,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:23:38,818 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:38,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1189636147, now seen corresponding path program 1 times [2025-03-03 14:23:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:38,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515124961] [2025-03-03 14:23:38,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:38,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:38,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:23:38,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:23:38,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:38,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:38,879 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-03 14:23:38,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:38,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515124961] [2025-03-03 14:23:38,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515124961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:38,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:38,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:38,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837879608] [2025-03-03 14:23:38,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:38,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:38,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:38,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:38,881 INFO L87 Difference]: Start difference. First operand 3408 states and 5763 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:39,006 INFO L93 Difference]: Finished difference Result 8200 states and 13951 transitions. [2025-03-03 14:23:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:39,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2025-03-03 14:23:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:39,035 INFO L225 Difference]: With dead ends: 8200 [2025-03-03 14:23:39,035 INFO L226 Difference]: Without dead ends: 5518 [2025-03-03 14:23:39,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:39,048 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 96 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:39,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1027 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2025-03-03 14:23:39,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 5510. [2025-03-03 14:23:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5510 states, 4512 states have (on average 1.6114804964539007) internal successors, (7271), 4518 states have internal predecessors, (7271), 970 states have call successors, (970), 26 states have call predecessors, (970), 27 states have return successors, (1085), 967 states have call predecessors, (1085), 967 states have call successors, (1085) [2025-03-03 14:23:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5510 states to 5510 states and 9326 transitions. [2025-03-03 14:23:39,362 INFO L78 Accepts]: Start accepts. Automaton has 5510 states and 9326 transitions. Word has length 153 [2025-03-03 14:23:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:39,362 INFO L471 AbstractCegarLoop]: Abstraction has 5510 states and 9326 transitions. [2025-03-03 14:23:39,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5510 states and 9326 transitions. [2025-03-03 14:23:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 14:23:39,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:39,386 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] [2025-03-03 14:23:39,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:23:39,386 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:39,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2111990214, now seen corresponding path program 1 times [2025-03-03 14:23:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:39,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118568069] [2025-03-03 14:23:39,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:39,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:39,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 14:23:39,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 14:23:39,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:39,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:39,448 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-03 14:23:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:39,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118568069] [2025-03-03 14:23:39,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118568069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:39,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:39,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:39,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629073795] [2025-03-03 14:23:39,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:39,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:39,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:39,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:39,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:39,450 INFO L87 Difference]: Start difference. First operand 5510 states and 9326 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:39,669 INFO L93 Difference]: Finished difference Result 13517 states and 23036 transitions. [2025-03-03 14:23:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:39,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2025-03-03 14:23:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:39,724 INFO L225 Difference]: With dead ends: 13517 [2025-03-03 14:23:39,724 INFO L226 Difference]: Without dead ends: 9129 [2025-03-03 14:23:39,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:39,738 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 94 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:39,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1028 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:39,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9129 states. [2025-03-03 14:23:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9129 to 9121. [2025-03-03 14:23:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9121 states, 7517 states have (on average 1.610482905414394) internal successors, (12106), 7523 states have internal predecessors, (12106), 1576 states have call successors, (1576), 26 states have call predecessors, (1576), 27 states have return successors, (1769), 1573 states have call predecessors, (1769), 1573 states have call successors, (1769) [2025-03-03 14:23:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9121 states to 9121 states and 15451 transitions. [2025-03-03 14:23:40,166 INFO L78 Accepts]: Start accepts. Automaton has 9121 states and 15451 transitions. Word has length 154 [2025-03-03 14:23:40,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:40,166 INFO L471 AbstractCegarLoop]: Abstraction has 9121 states and 15451 transitions. [2025-03-03 14:23:40,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 9121 states and 15451 transitions. [2025-03-03 14:23:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 14:23:40,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:40,201 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] [2025-03-03 14:23:40,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:23:40,202 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:40,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:40,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1618281454, now seen corresponding path program 1 times [2025-03-03 14:23:40,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:40,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081319288] [2025-03-03 14:23:40,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:40,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 14:23:40,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 14:23:40,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:40,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:40,254 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-03 14:23:40,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:40,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081319288] [2025-03-03 14:23:40,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081319288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:40,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:40,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:40,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650587460] [2025-03-03 14:23:40,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:40,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:40,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:40,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:40,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:40,256 INFO L87 Difference]: Start difference. First operand 9121 states and 15451 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:40,562 INFO L93 Difference]: Finished difference Result 23499 states and 39994 transitions. [2025-03-03 14:23:40,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:40,562 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 155 [2025-03-03 14:23:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:40,612 INFO L225 Difference]: With dead ends: 23499 [2025-03-03 14:23:40,613 INFO L226 Difference]: Without dead ends: 15945 [2025-03-03 14:23:40,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:40,636 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 92 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:40,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1037 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15945 states. [2025-03-03 14:23:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15945 to 15937. [2025-03-03 14:23:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15937 states, 13130 states have (on average 1.6023610053313024) internal successors, (21039), 13136 states have internal predecessors, (21039), 2779 states have call successors, (2779), 26 states have call predecessors, (2779), 27 states have return successors, (3116), 2776 states have call predecessors, (3116), 2776 states have call successors, (3116) [2025-03-03 14:23:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15937 states to 15937 states and 26934 transitions. [2025-03-03 14:23:41,322 INFO L78 Accepts]: Start accepts. Automaton has 15937 states and 26934 transitions. Word has length 155 [2025-03-03 14:23:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:41,322 INFO L471 AbstractCegarLoop]: Abstraction has 15937 states and 26934 transitions. [2025-03-03 14:23:41,322 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 15937 states and 26934 transitions. [2025-03-03 14:23:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 14:23:41,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:41,370 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] [2025-03-03 14:23:41,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:23:41,370 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:41,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:41,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2138559675, now seen corresponding path program 1 times [2025-03-03 14:23:41,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:41,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725637238] [2025-03-03 14:23:41,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:41,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:41,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 14:23:41,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 14:23:41,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:41,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:41,434 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-03 14:23:41,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:41,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725637238] [2025-03-03 14:23:41,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725637238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:41,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:41,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411477275] [2025-03-03 14:23:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:41,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:41,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:41,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:41,437 INFO L87 Difference]: Start difference. First operand 15937 states and 26934 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:42,085 INFO L93 Difference]: Finished difference Result 42070 states and 71456 transitions. [2025-03-03 14:23:42,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:42,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2025-03-03 14:23:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:42,191 INFO L225 Difference]: With dead ends: 42070 [2025-03-03 14:23:42,191 INFO L226 Difference]: Without dead ends: 28334 [2025-03-03 14:23:42,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:42,234 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 90 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:42,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1020 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28334 states. [2025-03-03 14:23:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28334 to 28326. [2025-03-03 14:23:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28326 states, 23480 states have (on average 1.5988074957410563) internal successors, (37540), 23486 states have internal predecessors, (37540), 4818 states have call successors, (4818), 26 states have call predecessors, (4818), 27 states have return successors, (5429), 4815 states have call predecessors, (5429), 4815 states have call successors, (5429) [2025-03-03 14:23:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28326 states to 28326 states and 47787 transitions. [2025-03-03 14:23:43,286 INFO L78 Accepts]: Start accepts. Automaton has 28326 states and 47787 transitions. Word has length 156 [2025-03-03 14:23:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:43,287 INFO L471 AbstractCegarLoop]: Abstraction has 28326 states and 47787 transitions. [2025-03-03 14:23:43,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 28326 states and 47787 transitions. [2025-03-03 14:23:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 14:23:43,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:43,343 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] [2025-03-03 14:23:43,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:23:43,343 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:43,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:43,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1445791505, now seen corresponding path program 1 times [2025-03-03 14:23:43,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:43,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171447758] [2025-03-03 14:23:43,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:43,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 14:23:43,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 14:23:43,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:43,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:43,402 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-03 14:23:43,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:43,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171447758] [2025-03-03 14:23:43,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171447758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:43,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:43,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:43,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871906128] [2025-03-03 14:23:43,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:43,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:43,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:43,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:43,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:43,404 INFO L87 Difference]: Start difference. First operand 28326 states and 47787 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:44,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:44,677 INFO L93 Difference]: Finished difference Result 77052 states and 130508 transitions. [2025-03-03 14:23:44,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:44,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 157 [2025-03-03 14:23:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:44,904 INFO L225 Difference]: With dead ends: 77052 [2025-03-03 14:23:44,905 INFO L226 Difference]: Without dead ends: 51690 [2025-03-03 14:23:44,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:44,990 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 88 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1020 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:44,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1020 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51690 states. [2025-03-03 14:23:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51690 to 51682. [2025-03-03 14:23:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51682 states, 43121 states have (on average 1.5936550636580784) internal successors, (68720), 43127 states have internal predecessors, (68720), 8533 states have call successors, (8533), 26 states have call predecessors, (8533), 27 states have return successors, (9676), 8530 states have call predecessors, (9676), 8530 states have call successors, (9676) [2025-03-03 14:23:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51682 states to 51682 states and 86929 transitions. [2025-03-03 14:23:46,974 INFO L78 Accepts]: Start accepts. Automaton has 51682 states and 86929 transitions. Word has length 157 [2025-03-03 14:23:46,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:46,975 INFO L471 AbstractCegarLoop]: Abstraction has 51682 states and 86929 transitions. [2025-03-03 14:23:46,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 51682 states and 86929 transitions. [2025-03-03 14:23:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 14:23:47,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:47,043 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-03 14:23:47,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:23:47,043 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:47,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2110517212, now seen corresponding path program 1 times [2025-03-03 14:23:47,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:47,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172108719] [2025-03-03 14:23:47,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:47,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:47,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 14:23:47,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:23:47,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:47,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:47,096 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-03 14:23:47,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:47,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172108719] [2025-03-03 14:23:47,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172108719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:47,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:47,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:47,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714346766] [2025-03-03 14:23:47,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:47,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:47,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:47,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:47,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:47,098 INFO L87 Difference]: Start difference. First operand 51682 states and 86929 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:48,783 INFO L93 Difference]: Finished difference Result 96313 states and 162359 transitions. [2025-03-03 14:23:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:48,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 158 [2025-03-03 14:23:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:49,215 INFO L225 Difference]: With dead ends: 96313 [2025-03-03 14:23:49,215 INFO L226 Difference]: Without dead ends: 96116 [2025-03-03 14:23:49,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:49,272 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 83 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:49,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1034 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96116 states. [2025-03-03 14:23:51,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96116 to 96108. [2025-03-03 14:23:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96108 states, 80748 states have (on average 1.5868380641006588) internal successors, (128134), 80754 states have internal predecessors, (128134), 15332 states have call successors, (15332), 26 states have call predecessors, (15332), 27 states have return successors, (17521), 15329 states have call predecessors, (17521), 15329 states have call successors, (17521) [2025-03-03 14:23:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96108 states to 96108 states and 160987 transitions. [2025-03-03 14:23:52,134 INFO L78 Accepts]: Start accepts. Automaton has 96108 states and 160987 transitions. Word has length 158 [2025-03-03 14:23:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:52,134 INFO L471 AbstractCegarLoop]: Abstraction has 96108 states and 160987 transitions. [2025-03-03 14:23:52,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 96108 states and 160987 transitions. [2025-03-03 14:23:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 14:23:52,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:52,238 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] [2025-03-03 14:23:52,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:23:52,238 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:52,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash -533169712, now seen corresponding path program 1 times [2025-03-03 14:23:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142930560] [2025-03-03 14:23:52,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:52,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:23:52,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:23:52,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:52,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:52,534 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-03 14:23:52,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:52,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142930560] [2025-03-03 14:23:52,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142930560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:52,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678970385] [2025-03-03 14:23:52,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:52,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:52,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:52,537 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:52,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:23:52,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:23:52,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:23:52,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:52,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:52,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:23:52,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:53,015 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-03 14:23:53,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:23:53,325 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-03 14:23:53,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678970385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:23:53,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:23:53,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-03-03 14:23:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284501066] [2025-03-03 14:23:53,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:23:53,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:23:53,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:53,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:23:53,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:23:53,327 INFO L87 Difference]: Start difference. First operand 96108 states and 160987 transitions. Second operand has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 24 states have internal predecessors, (245), 9 states have call successors, (50), 8 states have call predecessors, (50), 12 states have return successors, (44), 11 states have call predecessors, (44), 9 states have call successors, (44) [2025-03-03 14:24:07,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:07,108 INFO L93 Difference]: Finished difference Result 383361 states and 666107 transitions. [2025-03-03 14:24:07,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-03 14:24:07,109 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 24 states have internal predecessors, (245), 9 states have call successors, (50), 8 states have call predecessors, (50), 12 states have return successors, (44), 11 states have call predecessors, (44), 9 states have call successors, (44) Word has length 159 [2025-03-03 14:24:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:08,915 INFO L225 Difference]: With dead ends: 383361 [2025-03-03 14:24:08,916 INFO L226 Difference]: Without dead ends: 383172 [2025-03-03 14:24:09,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3481 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1363, Invalid=11293, Unknown=0, NotChecked=0, Total=12656 [2025-03-03 14:24:09,291 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 6797 mSDsluCounter, 4776 mSDsCounter, 0 mSdLazyCounter, 10909 mSolverCounterSat, 2114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6851 SdHoareTripleChecker+Valid, 5006 SdHoareTripleChecker+Invalid, 13023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2114 IncrementalHoareTripleChecker+Valid, 10909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:09,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6851 Valid, 5006 Invalid, 13023 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2114 Valid, 10909 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-03 14:24:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383172 states.