./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec7_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec7_product33.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 f1bf577a04d9efa22571cde3b0a4348a8cf7d4cfe89b0abb5b80fa76df1bbd4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:47:37,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:47:37,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:47:37,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:47:37,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:47:37,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:47:37,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:47:37,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:47:37,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:47:37,584 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:47:37,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:47:37,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:47:37,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:47:37,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:47:37,585 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:47:37,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:47:37,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:47:37,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:47:37,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:47:37,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:47:37,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:47:37,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:47:37,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:47:37,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:47:37,586 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:47:37,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:47:37,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:47:37,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:47:37,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:47:37,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:47:37,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:47:37,587 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-jdk21/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 -> f1bf577a04d9efa22571cde3b0a4348a8cf7d4cfe89b0abb5b80fa76df1bbd4f [2025-02-05 15:47:37,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:47:37,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:47:37,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:47:37,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:47:37,854 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:47:37,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec7_product33.cil.c [2025-02-05 15:47:39,752 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1886c267/05eda03a27d34819b728218a11f13c3d/FLAGdf5c8a2f6 [2025-02-05 15:47:40,103 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:47:40,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product33.cil.c [2025-02-05 15:47:40,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1886c267/05eda03a27d34819b728218a11f13c3d/FLAGdf5c8a2f6 [2025-02-05 15:47:40,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1886c267/05eda03a27d34819b728218a11f13c3d [2025-02-05 15:47:40,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:47:40,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:47:40,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:47:40,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:47:40,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:47:40,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653cda4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40, skipping insertion in model container [2025-02-05 15:47:40,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:47:40,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product33.cil.c[20852,20865] [2025-02-05 15:47:40,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:47:40,537 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:47:40,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-02-05 15:47:40,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [208] [2025-02-05 15:47:40,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [574] [2025-02-05 15:47:40,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [593] [2025-02-05 15:47:40,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [908] [2025-02-05 15:47:40,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [943] [2025-02-05 15:47:40,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [952] [2025-02-05 15:47:40,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2023] [2025-02-05 15:47:40,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2242] [2025-02-05 15:47:40,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2633] [2025-02-05 15:47:40,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [3030] [2025-02-05 15:47:40,593 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product33.cil.c[20852,20865] [2025-02-05 15:47:40,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:47:40,669 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:47:40,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40 WrapperNode [2025-02-05 15:47:40,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:47:40,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:47:40,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:47:40,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:47:40,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,724 INFO L138 Inliner]: procedures = 134, calls = 211, calls flagged for inlining = 65, calls inlined = 60, statements flattened = 1065 [2025-02-05 15:47:40,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:47:40,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:47:40,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:47:40,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:47:40,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,767 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-02-05 15:47:40,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:47:40,803 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:47:40,803 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:47:40,803 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:47:40,804 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (1/1) ... [2025-02-05 15:47:40,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:47:40,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:40,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:47:40,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:47:40,864 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:47:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:47:40,864 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:47:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:47:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:47:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:47:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:47:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:47:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:47:40,866 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:47:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:47:40,866 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:47:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:47:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:47:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:47:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:47:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:47:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:47:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:47:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:47:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:47:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:47:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:47:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:47:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:47:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:47:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:47:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:47:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:47:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:47:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:47:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:47:40,868 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:47:40,868 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:47:40,868 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:47:40,868 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:47:40,868 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:47:40,868 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:47:40,868 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:47:40,868 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:47:40,868 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:47:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:47:40,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:47:41,081 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:47:41,084 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:47:41,431 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1953-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~25#1; [2025-02-05 15:47:41,431 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3011-1: isVerified_#res#1 := isVerified_~retValue_acc~42#1; [2025-02-05 15:47:41,431 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2674-1: getEmailId_#res#1 := getEmailId_~retValue_acc~33#1; [2025-02-05 15:47:41,431 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1518-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~18#1; [2025-02-05 15:47:41,432 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2000-1: getClientId_#res#1 := getClientId_~retValue_acc~26#1; [2025-02-05 15:47:41,439 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937: #res := ~retValue_acc~40; [2025-02-05 15:47:41,450 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2521: #res := ~retValue_acc~31; [2025-02-05 15:47:41,474 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657: #res#1 := ~retValue_acc~21#1; [2025-02-05 15:47:41,474 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1612-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~20#1; [2025-02-05 15:47:41,495 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881: #res := ~retValue_acc~24; [2025-02-05 15:47:41,503 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565: #res := ~retValue_acc~19; [2025-02-05 15:47:41,512 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L205-1: createEmail_#res#1 := createEmail_~retValue_acc~3#1; [2025-02-05 15:47:41,524 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2863: #res := ~retValue_acc~38; [2025-02-05 15:47:41,536 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2900: #res := ~retValue_acc~39; [2025-02-05 15:47:41,542 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: #res := ~retValue_acc~41; [2025-02-05 15:47:41,563 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2748: #res := ~retValue_acc~35; [2025-02-05 15:47:41,812 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~30#1; [2025-02-05 15:47:41,812 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1720-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~22#1; [2025-02-05 15:47:41,812 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L940-1: valid_product_#res#1 := valid_product_~retValue_acc~9#1; [2025-02-05 15:47:41,812 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~28#1; [2025-02-05 15:47:41,812 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2487-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~29#1; [2025-02-05 15:47:41,813 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~23#1; [2025-02-05 15:47:41,819 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2711: #res := ~retValue_acc~34; [2025-02-05 15:47:41,829 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L161-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~0#1; [2025-02-05 15:47:41,829 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: #res#1 := ~retValue_acc~1#1; [2025-02-05 15:47:42,010 INFO L? ?]: Removed 497 outVars from TransFormulas that were not future-live. [2025-02-05 15:47:42,012 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:47:42,027 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:47:42,027 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:47:42,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:47:42 BoogieIcfgContainer [2025-02-05 15:47:42,028 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:47:42,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:47:42,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:47:42,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:47:42,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:47:40" (1/3) ... [2025-02-05 15:47:42,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c2deaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:47:42, skipping insertion in model container [2025-02-05 15:47:42,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:40" (2/3) ... [2025-02-05 15:47:42,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c2deaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:47:42, skipping insertion in model container [2025-02-05 15:47:42,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:47:42" (3/3) ... [2025-02-05 15:47:42,036 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec7_product33.cil.c [2025-02-05 15:47:42,049 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:47:42,053 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec7_product33.cil.c that has 25 procedures, 384 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:47:42,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:47:42,120 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;@2d3a1bcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:47:42,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:47:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 384 states, 296 states have (on average 1.5) internal successors, (444), 300 states have internal predecessors, (444), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 15:47:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:47:42,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:42,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:47:42,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:42,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:42,142 INFO L85 PathProgramCache]: Analyzing trace with hash 798468145, now seen corresponding path program 1 times [2025-02-05 15:47:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:42,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461333410] [2025-02-05 15:47:42,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:42,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:42,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:47:42,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:47:42,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:42,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:47:42,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:42,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461333410] [2025-02-05 15:47:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461333410] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:42,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850038288] [2025-02-05 15:47:42,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:42,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:47:42,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:47:43,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:47:43,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:47:43,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:43,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:43,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:47:43,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:47:43,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:43,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850038288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:43,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:43,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:47:43,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474290415] [2025-02-05 15:47:43,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:43,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:47:43,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:43,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:47:43,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:47:43,233 INFO L87 Difference]: Start difference. First operand has 384 states, 296 states have (on average 1.5) internal successors, (444), 300 states have internal predecessors, (444), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:43,291 INFO L93 Difference]: Finished difference Result 610 states and 884 transitions. [2025-02-05 15:47:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:47:43,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 120 [2025-02-05 15:47:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:43,309 INFO L225 Difference]: With dead ends: 610 [2025-02-05 15:47:43,309 INFO L226 Difference]: Without dead ends: 377 [2025-02-05 15:47:43,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 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-02-05 15:47:43,314 INFO L435 NwaCegarLoop]: 565 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, 565 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-02-05 15:47:43,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-02-05 15:47:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-02-05 15:47:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 290 states have (on average 1.4965517241379311) internal successors, (434), 293 states have internal predecessors, (434), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-05 15:47:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 557 transitions. [2025-02-05 15:47:43,388 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 557 transitions. Word has length 120 [2025-02-05 15:47:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:43,392 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 557 transitions. [2025-02-05 15:47:43,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:43,392 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 557 transitions. [2025-02-05 15:47:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:47:43,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:43,401 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:47:43,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:47:43,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:47:43,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:43,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:43,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1454197065, now seen corresponding path program 1 times [2025-02-05 15:47:43,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:43,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337085889] [2025-02-05 15:47:43,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:43,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:43,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:47:43,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:47:43,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:43,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:47:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337085889] [2025-02-05 15:47:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337085889] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344371329] [2025-02-05 15:47:43,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:43,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:43,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:43,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:47:43,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:47:44,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:47:44,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:47:44,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:44,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:44,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:47:44,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:47:44,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344371329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:44,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:44,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:47:44,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741851997] [2025-02-05 15:47:44,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:44,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:44,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:44,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:44,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:47:44,204 INFO L87 Difference]: Start difference. First operand 377 states and 557 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:44,240 INFO L93 Difference]: Finished difference Result 599 states and 865 transitions. [2025-02-05 15:47:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:44,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 121 [2025-02-05 15:47:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:44,247 INFO L225 Difference]: With dead ends: 599 [2025-02-05 15:47:44,247 INFO L226 Difference]: Without dead ends: 379 [2025-02-05 15:47:44,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 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-02-05 15:47:44,249 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1110 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-02-05 15:47:44,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-02-05 15:47:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-02-05 15:47:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.4931506849315068) internal successors, (436), 295 states have internal predecessors, (436), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-05 15:47:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 559 transitions. [2025-02-05 15:47:44,276 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 559 transitions. Word has length 121 [2025-02-05 15:47:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:44,277 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 559 transitions. [2025-02-05 15:47:44,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 559 transitions. [2025-02-05 15:47:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:47:44,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:44,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:47:44,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:47:44,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:44,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:44,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1594909549, now seen corresponding path program 1 times [2025-02-05 15:47:44,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:44,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46076211] [2025-02-05 15:47:44,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:44,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:44,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:47:44,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:47:44,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:44,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:47:44,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:44,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46076211] [2025-02-05 15:47:44,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46076211] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:44,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275693165] [2025-02-05 15:47:44,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:44,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:44,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:44,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:47:44,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:47:44,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:47:44,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:47:44,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:44,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:44,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:47:45,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:47:45,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275693165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:45,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:45,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:47:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207608152] [2025-02-05 15:47:45,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:45,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:45,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:45,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:45,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:47:45,028 INFO L87 Difference]: Start difference. First operand 379 states and 559 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:45,071 INFO L93 Difference]: Finished difference Result 792 states and 1184 transitions. [2025-02-05 15:47:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:45,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-02-05 15:47:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:45,077 INFO L225 Difference]: With dead ends: 792 [2025-02-05 15:47:45,077 INFO L226 Difference]: Without dead ends: 440 [2025-02-05 15:47:45,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 129 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-02-05 15:47:45,081 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 115 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1075 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-02-05 15:47:45,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1075 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-05 15:47:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 432. [2025-02-05 15:47:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 334 states have (on average 1.5119760479041917) internal successors, (505), 337 states have internal predecessors, (505), 73 states have call successors, (73), 24 states have call predecessors, (73), 24 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-05 15:47:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 650 transitions. [2025-02-05 15:47:45,107 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 650 transitions. Word has length 129 [2025-02-05 15:47:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:45,108 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 650 transitions. [2025-02-05 15:47:45,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 650 transitions. [2025-02-05 15:47:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:47:45,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:45,125 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:47:45,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:47:45,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:45,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:45,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:45,326 INFO L85 PathProgramCache]: Analyzing trace with hash 703545551, now seen corresponding path program 1 times [2025-02-05 15:47:45,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:45,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485027216] [2025-02-05 15:47:45,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:45,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:45,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:47:45,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:47:45,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:45,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:47:45,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485027216] [2025-02-05 15:47:45,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485027216] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846175102] [2025-02-05 15:47:45,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:45,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:45,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:45,540 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:47:45,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:47:45,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:47:45,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:47:45,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:45,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:45,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:47:45,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:47:45,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846175102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:45,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:45,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:47:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057441854] [2025-02-05 15:47:45,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:45,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:47:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:45,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:47:45,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:47:45,958 INFO L87 Difference]: Start difference. First operand 432 states and 650 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:47:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:46,039 INFO L93 Difference]: Finished difference Result 855 states and 1290 transitions. [2025-02-05 15:47:46,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:47:46,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 130 [2025-02-05 15:47:46,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:46,042 INFO L225 Difference]: With dead ends: 855 [2025-02-05 15:47:46,042 INFO L226 Difference]: Without dead ends: 434 [2025-02-05 15:47:46,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 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-02-05 15:47:46,047 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 2 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2185 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-02-05 15:47:46,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2185 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-02-05 15:47:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2025-02-05 15:47:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 335 states have (on average 1.51044776119403) internal successors, (506), 339 states have internal predecessors, (506), 73 states have call successors, (73), 24 states have call predecessors, (73), 25 states have return successors, (74), 72 states have call predecessors, (74), 72 states have call successors, (74) [2025-02-05 15:47:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 653 transitions. [2025-02-05 15:47:46,069 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 653 transitions. Word has length 130 [2025-02-05 15:47:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:46,070 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 653 transitions. [2025-02-05 15:47:46,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:47:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 653 transitions. [2025-02-05 15:47:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:47:46,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:46,073 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-02-05 15:47:46,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:47:46,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:46,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:46,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1056807915, now seen corresponding path program 1 times [2025-02-05 15:47:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052530974] [2025-02-05 15:47:46,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:46,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:46,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:47:46,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:47:46,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:46,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:47:46,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:46,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052530974] [2025-02-05 15:47:46,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052530974] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:46,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105478772] [2025-02-05 15:47:46,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:46,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:46,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:46,455 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:47:46,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:47:46,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:47:46,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:47:46,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:46,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:46,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:47:46,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:47:46,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:46,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105478772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:46,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:46,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:47:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614406014] [2025-02-05 15:47:46,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:46,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:47:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:46,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:47:46,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:47:46,757 INFO L87 Difference]: Start difference. First operand 434 states and 653 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:47:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:46,813 INFO L93 Difference]: Finished difference Result 857 states and 1295 transitions. [2025-02-05 15:47:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:47:46,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 131 [2025-02-05 15:47:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:46,816 INFO L225 Difference]: With dead ends: 857 [2025-02-05 15:47:46,816 INFO L226 Difference]: Without dead ends: 436 [2025-02-05 15:47:46,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 129 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-02-05 15:47:46,818 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 2 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2171 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-02-05 15:47:46,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2171 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-05 15:47:46,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-02-05 15:47:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 336 states have (on average 1.5089285714285714) internal successors, (507), 341 states have internal predecessors, (507), 73 states have call successors, (73), 24 states have call predecessors, (73), 26 states have return successors, (79), 72 states have call predecessors, (79), 72 states have call successors, (79) [2025-02-05 15:47:46,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 659 transitions. [2025-02-05 15:47:46,838 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 659 transitions. Word has length 131 [2025-02-05 15:47:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:46,838 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 659 transitions. [2025-02-05 15:47:46,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:47:46,838 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 659 transitions. [2025-02-05 15:47:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:47:46,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:46,841 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:47:46,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:47:47,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:47,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:47,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:47,043 INFO L85 PathProgramCache]: Analyzing trace with hash -702812247, now seen corresponding path program 1 times [2025-02-05 15:47:47,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:47,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026758975] [2025-02-05 15:47:47,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:47,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:47,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:47:47,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:47:47,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:47,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:47:47,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:47,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026758975] [2025-02-05 15:47:47,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026758975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:47,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:47,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:47:47,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026371160] [2025-02-05 15:47:47,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:47,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:47:47,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:47,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:47:47,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:47:47,248 INFO L87 Difference]: Start difference. First operand 436 states and 659 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:47:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:47,301 INFO L93 Difference]: Finished difference Result 849 states and 1286 transitions. [2025-02-05 15:47:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:47:47,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 132 [2025-02-05 15:47:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:47,305 INFO L225 Difference]: With dead ends: 849 [2025-02-05 15:47:47,306 INFO L226 Difference]: Without dead ends: 436 [2025-02-05 15:47:47,307 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-02-05 15:47:47,308 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 2 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2189 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-02-05 15:47:47,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2189 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-05 15:47:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-02-05 15:47:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 336 states have (on average 1.5089285714285714) internal successors, (507), 341 states have internal predecessors, (507), 73 states have call successors, (73), 24 states have call predecessors, (73), 26 states have return successors, (78), 72 states have call predecessors, (78), 72 states have call successors, (78) [2025-02-05 15:47:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 658 transitions. [2025-02-05 15:47:47,331 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 658 transitions. Word has length 132 [2025-02-05 15:47:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:47,332 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 658 transitions. [2025-02-05 15:47:47,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:47:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 658 transitions. [2025-02-05 15:47:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:47:47,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:47,335 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:47:47,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:47:47,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:47,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1698588045, now seen corresponding path program 2 times [2025-02-05 15:47:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:47,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025483650] [2025-02-05 15:47:47,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:47:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:47,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-02-05 15:47:47,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 59 of 133 statements. [2025-02-05 15:47:47,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:47:47,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:47:47,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:47,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025483650] [2025-02-05 15:47:47,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025483650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:47,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:47,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:47:47,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100137314] [2025-02-05 15:47:47,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:47,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:47:47,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:47,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:47:47,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:47:47,499 INFO L87 Difference]: Start difference. First operand 436 states and 658 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:47:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:47,917 INFO L93 Difference]: Finished difference Result 1161 states and 1738 transitions. [2025-02-05 15:47:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:47:47,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 133 [2025-02-05 15:47:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:47,923 INFO L225 Difference]: With dead ends: 1161 [2025-02-05 15:47:47,923 INFO L226 Difference]: Without dead ends: 949 [2025-02-05 15:47:47,924 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-02-05 15:47:47,925 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 663 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 3748 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:47,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 3748 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:47:47,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-02-05 15:47:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 853. [2025-02-05 15:47:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 661 states have (on average 1.5173978819969742) internal successors, (1003), 668 states have internal predecessors, (1003), 140 states have call successors, (140), 48 states have call predecessors, (140), 51 states have return successors, (153), 140 states have call predecessors, (153), 138 states have call successors, (153) [2025-02-05 15:47:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1296 transitions. [2025-02-05 15:47:47,995 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1296 transitions. Word has length 133 [2025-02-05 15:47:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:47,995 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1296 transitions. [2025-02-05 15:47:47,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:47:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1296 transitions. [2025-02-05 15:47:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:47:47,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:48,000 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:47:48,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:47:48,000 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:48,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:48,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1892095394, now seen corresponding path program 1 times [2025-02-05 15:47:48,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:48,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332202777] [2025-02-05 15:47:48,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:48,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:48,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:47:48,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:47:48,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:48,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:47:48,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:48,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332202777] [2025-02-05 15:47:48,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332202777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:48,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:48,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:47:48,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698957045] [2025-02-05 15:47:48,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:48,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:47:48,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:48,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:47:48,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:47:48,173 INFO L87 Difference]: Start difference. First operand 853 states and 1296 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:47:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:48,254 INFO L93 Difference]: Finished difference Result 1685 states and 2565 transitions. [2025-02-05 15:47:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:47:48,255 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 134 [2025-02-05 15:47:48,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:48,260 INFO L225 Difference]: With dead ends: 1685 [2025-02-05 15:47:48,260 INFO L226 Difference]: Without dead ends: 855 [2025-02-05 15:47:48,263 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-02-05 15:47:48,264 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 1 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2192 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-02-05 15:47:48,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2192 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:48,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-02-05 15:47:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2025-02-05 15:47:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 662 states have (on average 1.5166163141993958) internal successors, (1004), 670 states have internal predecessors, (1004), 140 states have call successors, (140), 48 states have call predecessors, (140), 52 states have return successors, (155), 140 states have call predecessors, (155), 138 states have call successors, (155) [2025-02-05 15:47:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1299 transitions. [2025-02-05 15:47:48,301 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1299 transitions. Word has length 134 [2025-02-05 15:47:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:48,302 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1299 transitions. [2025-02-05 15:47:48,302 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:47:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1299 transitions. [2025-02-05 15:47:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:47:48,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:48,305 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:47:48,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:47:48,305 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:48,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1925829051, now seen corresponding path program 1 times [2025-02-05 15:47:48,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:48,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896919874] [2025-02-05 15:47:48,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:48,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:48,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:47:48,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:47:48,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:48,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:47:48,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:48,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896919874] [2025-02-05 15:47:48,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896919874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:48,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:48,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:47:48,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103858515] [2025-02-05 15:47:48,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:48,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:47:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:48,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:47:48,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:47:48,439 INFO L87 Difference]: Start difference. First operand 855 states and 1299 transitions. Second operand has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:47:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:48,545 INFO L93 Difference]: Finished difference Result 1266 states and 1922 transitions. [2025-02-05 15:47:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:47:48,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 135 [2025-02-05 15:47:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:48,548 INFO L225 Difference]: With dead ends: 1266 [2025-02-05 15:47:48,548 INFO L226 Difference]: Without dead ends: 440 [2025-02-05 15:47:48,550 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-02-05 15:47:48,551 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 7 mSDsluCounter, 3217 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3758 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-02-05 15:47:48,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3758 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:47:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-05 15:47:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-02-05 15:47:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 339 states have (on average 1.5044247787610618) internal successors, (510), 344 states have internal predecessors, (510), 73 states have call successors, (73), 25 states have call predecessors, (73), 27 states have return successors, (79), 72 states have call predecessors, (79), 72 states have call successors, (79) [2025-02-05 15:47:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 662 transitions. [2025-02-05 15:47:48,564 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 662 transitions. Word has length 135 [2025-02-05 15:47:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:48,564 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 662 transitions. [2025-02-05 15:47:48,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:47:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 662 transitions. [2025-02-05 15:47:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:47:48,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:48,566 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:47:48,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:47:48,567 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:48,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:48,567 INFO L85 PathProgramCache]: Analyzing trace with hash -195953562, now seen corresponding path program 1 times [2025-02-05 15:47:48,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:48,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147307380] [2025-02-05 15:47:48,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:48,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:47:48,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:47:48,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:48,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:47:48,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:48,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147307380] [2025-02-05 15:47:48,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147307380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:48,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:48,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:47:48,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600233828] [2025-02-05 15:47:48,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:48,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:47:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:48,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:47:48,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:47:48,707 INFO L87 Difference]: Start difference. First operand 440 states and 662 transitions. Second operand has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:47:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:48,821 INFO L93 Difference]: Finished difference Result 856 states and 1295 transitions. [2025-02-05 15:47:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:47:48,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 135 [2025-02-05 15:47:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:48,824 INFO L225 Difference]: With dead ends: 856 [2025-02-05 15:47:48,824 INFO L226 Difference]: Without dead ends: 443 [2025-02-05 15:47:48,826 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-02-05 15:47:48,826 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 5 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3772 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-02-05 15:47:48,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3772 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:47:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-02-05 15:47:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2025-02-05 15:47:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 341 states have (on average 1.501466275659824) internal successors, (512), 347 states have internal predecessors, (512), 73 states have call successors, (73), 25 states have call predecessors, (73), 28 states have return successors, (84), 72 states have call predecessors, (84), 72 states have call successors, (84) [2025-02-05 15:47:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 669 transitions. [2025-02-05 15:47:48,842 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 669 transitions. Word has length 135 [2025-02-05 15:47:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:48,842 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 669 transitions. [2025-02-05 15:47:48,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:47:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 669 transitions. [2025-02-05 15:47:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:47:48,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:48,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:47:48,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:47:48,844 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:48,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:48,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2105791267, now seen corresponding path program 1 times [2025-02-05 15:47:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:48,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169305293] [2025-02-05 15:47:48,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:48,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:48,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:47:48,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:47:48,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:48,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:47:48,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:48,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169305293] [2025-02-05 15:47:48,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169305293] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:48,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310789194] [2025-02-05 15:47:48,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:48,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:48,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:48,980 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:47:48,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:47:49,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:47:49,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:47:49,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:49,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:49,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:47:49,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:47:49,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:47:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:47:49,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310789194] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:47:49,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:47:49,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:47:49,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171350257] [2025-02-05 15:47:49,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:47:49,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:47:49,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:49,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:47:49,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:47:49,377 INFO L87 Difference]: Start difference. First operand 443 states and 669 transitions. Second operand has 11 states, 10 states have (on average 13.9) internal successors, (139), 11 states have internal predecessors, (139), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-05 15:47:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:49,903 INFO L93 Difference]: Finished difference Result 1228 states and 1940 transitions. [2025-02-05 15:47:49,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:47:49,903 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.9) internal successors, (139), 11 states have internal predecessors, (139), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) Word has length 136 [2025-02-05 15:47:49,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:49,908 INFO L225 Difference]: With dead ends: 1228 [2025-02-05 15:47:49,908 INFO L226 Difference]: Without dead ends: 817 [2025-02-05 15:47:49,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 269 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-02-05 15:47:49,910 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 1278 mSDsluCounter, 3285 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 3824 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:49,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 3824 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:47:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2025-02-05 15:47:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 793. [2025-02-05 15:47:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 627 states have (on average 1.5629984051036683) internal successors, (980), 632 states have internal predecessors, (980), 137 states have call successors, (137), 26 states have call predecessors, (137), 28 states have return successors, (158), 136 states have call predecessors, (158), 136 states have call successors, (158) [2025-02-05 15:47:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1275 transitions. [2025-02-05 15:47:49,941 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1275 transitions. Word has length 136 [2025-02-05 15:47:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:49,942 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1275 transitions. [2025-02-05 15:47:49,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.9) internal successors, (139), 11 states have internal predecessors, (139), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-05 15:47:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1275 transitions. [2025-02-05 15:47:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:47:49,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:49,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:47:49,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:47:50,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:47:50,150 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:50,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:50,150 INFO L85 PathProgramCache]: Analyzing trace with hash 719781680, now seen corresponding path program 1 times [2025-02-05 15:47:50,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:50,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527775706] [2025-02-05 15:47:50,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:50,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:50,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:47:50,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:47:50,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:50,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:47:50,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:50,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527775706] [2025-02-05 15:47:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527775706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:50,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:50,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146159351] [2025-02-05 15:47:50,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:50,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:50,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:50,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:50,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:50,211 INFO L87 Difference]: Start difference. First operand 793 states and 1275 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:50,250 INFO L93 Difference]: Finished difference Result 1833 states and 3000 transitions. [2025-02-05 15:47:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:50,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-02-05 15:47:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:50,256 INFO L225 Difference]: With dead ends: 1833 [2025-02-05 15:47:50,256 INFO L226 Difference]: Without dead ends: 1121 [2025-02-05 15:47:50,259 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-02-05 15:47:50,259 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 112 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1110 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-02-05 15:47:50,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1110 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-02-05 15:47:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1113. [2025-02-05 15:47:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 883 states have (on average 1.5855039637599093) internal successors, (1400), 888 states have internal predecessors, (1400), 201 states have call successors, (201), 26 states have call predecessors, (201), 28 states have return successors, (232), 200 states have call predecessors, (232), 200 states have call successors, (232) [2025-02-05 15:47:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1833 transitions. [2025-02-05 15:47:50,319 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1833 transitions. Word has length 139 [2025-02-05 15:47:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:50,319 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1833 transitions. [2025-02-05 15:47:50,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1833 transitions. [2025-02-05 15:47:50,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:47:50,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:50,324 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:47:50,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:47:50,325 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:50,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:50,325 INFO L85 PathProgramCache]: Analyzing trace with hash -758883717, now seen corresponding path program 1 times [2025-02-05 15:47:50,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:50,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107630369] [2025-02-05 15:47:50,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:50,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:50,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:47:50,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:47:50,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:50,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:47:50,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:50,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107630369] [2025-02-05 15:47:50,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107630369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:50,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:50,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178514039] [2025-02-05 15:47:50,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:50,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:50,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:50,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:50,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:50,380 INFO L87 Difference]: Start difference. First operand 1113 states and 1833 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:50,429 INFO L93 Difference]: Finished difference Result 2627 states and 4357 transitions. [2025-02-05 15:47:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:50,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2025-02-05 15:47:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:50,439 INFO L225 Difference]: With dead ends: 2627 [2025-02-05 15:47:50,439 INFO L226 Difference]: Without dead ends: 1646 [2025-02-05 15:47:50,442 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-02-05 15:47:50,443 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 110 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1104 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-02-05 15:47:50,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1104 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:50,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2025-02-05 15:47:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1638. [2025-02-05 15:47:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1313 states have (on average 1.5978674790555978) internal successors, (2098), 1318 states have internal predecessors, (2098), 296 states have call successors, (296), 26 states have call predecessors, (296), 28 states have return successors, (327), 295 states have call predecessors, (327), 295 states have call successors, (327) [2025-02-05 15:47:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2721 transitions. [2025-02-05 15:47:50,505 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2721 transitions. Word has length 140 [2025-02-05 15:47:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:50,505 INFO L471 AbstractCegarLoop]: Abstraction has 1638 states and 2721 transitions. [2025-02-05 15:47:50,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2721 transitions. [2025-02-05 15:47:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 15:47:50,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:50,513 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:47:50,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:47:50,513 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:50,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash -660869233, now seen corresponding path program 1 times [2025-02-05 15:47:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:50,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107223269] [2025-02-05 15:47:50,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:50,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:50,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 15:47:50,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 15:47:50,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:50,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:47:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107223269] [2025-02-05 15:47:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107223269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:50,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158114699] [2025-02-05 15:47:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:50,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:50,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:50,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:50,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:50,564 INFO L87 Difference]: Start difference. First operand 1638 states and 2721 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:50,644 INFO L93 Difference]: Finished difference Result 3816 states and 6391 transitions. [2025-02-05 15:47:50,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:50,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2025-02-05 15:47:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:50,658 INFO L225 Difference]: With dead ends: 3816 [2025-02-05 15:47:50,658 INFO L226 Difference]: Without dead ends: 2442 [2025-02-05 15:47:50,663 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-02-05 15:47:50,663 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 108 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1101 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-02-05 15:47:50,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-02-05 15:47:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2434. [2025-02-05 15:47:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 1986 states have (on average 1.607250755287009) internal successors, (3192), 1991 states have internal predecessors, (3192), 419 states have call successors, (419), 26 states have call predecessors, (419), 28 states have return successors, (466), 418 states have call predecessors, (466), 418 states have call successors, (466) [2025-02-05 15:47:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 4077 transitions. [2025-02-05 15:47:50,767 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 4077 transitions. Word has length 141 [2025-02-05 15:47:50,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:50,767 INFO L471 AbstractCegarLoop]: Abstraction has 2434 states and 4077 transitions. [2025-02-05 15:47:50,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 4077 transitions. [2025-02-05 15:47:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:47:50,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:50,778 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:47:50,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:47:50,778 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:50,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1784325188, now seen corresponding path program 1 times [2025-02-05 15:47:50,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:50,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590004159] [2025-02-05 15:47:50,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:50,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:47:50,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:47:50,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:50,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:47:50,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:50,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590004159] [2025-02-05 15:47:50,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590004159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:50,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:50,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639170417] [2025-02-05 15:47:50,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:50,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:50,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:50,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:50,841 INFO L87 Difference]: Start difference. First operand 2434 states and 4077 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:50,945 INFO L93 Difference]: Finished difference Result 5669 states and 9563 transitions. [2025-02-05 15:47:50,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:50,946 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-02-05 15:47:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:50,963 INFO L225 Difference]: With dead ends: 5669 [2025-02-05 15:47:50,963 INFO L226 Difference]: Without dead ends: 3714 [2025-02-05 15:47:50,969 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-02-05 15:47:50,970 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 106 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1101 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-02-05 15:47:50,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2025-02-05 15:47:51,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 3706. [2025-02-05 15:47:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3706 states, 3079 states have (on average 1.6135108801558948) internal successors, (4968), 3084 states have internal predecessors, (4968), 598 states have call successors, (598), 26 states have call predecessors, (598), 28 states have return successors, (671), 597 states have call predecessors, (671), 597 states have call successors, (671) [2025-02-05 15:47:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 6237 transitions. [2025-02-05 15:47:51,126 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 6237 transitions. Word has length 142 [2025-02-05 15:47:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:51,127 INFO L471 AbstractCegarLoop]: Abstraction has 3706 states and 6237 transitions. [2025-02-05 15:47:51,127 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 6237 transitions. [2025-02-05 15:47:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 15:47:51,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:51,141 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:47:51,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:47:51,141 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:51,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:51,141 INFO L85 PathProgramCache]: Analyzing trace with hash 676159758, now seen corresponding path program 1 times [2025-02-05 15:47:51,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:51,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566699059] [2025-02-05 15:47:51,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:51,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:51,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:47:51,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:47:51,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:51,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:47:51,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:51,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566699059] [2025-02-05 15:47:51,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566699059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:51,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:51,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:51,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268165180] [2025-02-05 15:47:51,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:51,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:51,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:51,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:51,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:51,222 INFO L87 Difference]: Start difference. First operand 3706 states and 6237 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:51,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:51,416 INFO L93 Difference]: Finished difference Result 8716 states and 14771 transitions. [2025-02-05 15:47:51,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:51,416 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2025-02-05 15:47:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:51,448 INFO L225 Difference]: With dead ends: 8716 [2025-02-05 15:47:51,448 INFO L226 Difference]: Without dead ends: 5816 [2025-02-05 15:47:51,460 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-02-05 15:47:51,462 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 104 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1121 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-02-05 15:47:51,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2025-02-05 15:47:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 5808. [2025-02-05 15:47:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5808 states, 4805 states have (on average 1.6097814776274715) internal successors, (7735), 4810 states have internal predecessors, (7735), 974 states have call successors, (974), 26 states have call predecessors, (974), 28 states have return successors, (1091), 973 states have call predecessors, (1091), 973 states have call successors, (1091) [2025-02-05 15:47:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 9800 transitions. [2025-02-05 15:47:51,799 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 9800 transitions. Word has length 143 [2025-02-05 15:47:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:51,799 INFO L471 AbstractCegarLoop]: Abstraction has 5808 states and 9800 transitions. [2025-02-05 15:47:51,799 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 9800 transitions. [2025-02-05 15:47:51,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 15:47:51,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:51,820 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:47:51,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:47:51,821 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:51,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:51,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1819357949, now seen corresponding path program 1 times [2025-02-05 15:47:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:51,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641860178] [2025-02-05 15:47:51,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:51,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 15:47:51,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 15:47:51,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:51,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:47:51,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:51,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641860178] [2025-02-05 15:47:51,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641860178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:51,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:51,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:51,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906777062] [2025-02-05 15:47:51,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:51,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:51,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:51,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:51,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:51,867 INFO L87 Difference]: Start difference. First operand 5808 states and 9800 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:52,096 INFO L93 Difference]: Finished difference Result 14228 states and 24168 transitions. [2025-02-05 15:47:52,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:52,097 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2025-02-05 15:47:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:52,165 INFO L225 Difference]: With dead ends: 14228 [2025-02-05 15:47:52,166 INFO L226 Difference]: Without dead ends: 9622 [2025-02-05 15:47:52,188 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-02-05 15:47:52,188 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 102 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1116 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-02-05 15:47:52,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2025-02-05 15:47:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 9614. [2025-02-05 15:47:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9614 states, 8005 states have (on average 1.6092442223610244) internal successors, (12882), 8010 states have internal predecessors, (12882), 1580 states have call successors, (1580), 26 states have call predecessors, (1580), 28 states have return successors, (1775), 1579 states have call predecessors, (1775), 1579 states have call successors, (1775) [2025-02-05 15:47:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 16237 transitions. [2025-02-05 15:47:52,664 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 16237 transitions. Word has length 144 [2025-02-05 15:47:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:52,664 INFO L471 AbstractCegarLoop]: Abstraction has 9614 states and 16237 transitions. [2025-02-05 15:47:52,665 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 16237 transitions. [2025-02-05 15:47:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 15:47:52,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:52,694 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:47:52,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:47:52,694 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:52,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:52,694 INFO L85 PathProgramCache]: Analyzing trace with hash 151082157, now seen corresponding path program 1 times [2025-02-05 15:47:52,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:52,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131394049] [2025-02-05 15:47:52,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:52,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:52,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:47:52,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:47:52,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:47:52,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:52,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131394049] [2025-02-05 15:47:52,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131394049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:52,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:52,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:52,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280106728] [2025-02-05 15:47:52,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:52,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:52,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:52,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:52,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:52,765 INFO L87 Difference]: Start difference. First operand 9614 states and 16237 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:53,451 INFO L93 Difference]: Finished difference Result 24735 states and 41966 transitions. [2025-02-05 15:47:53,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:53,451 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-02-05 15:47:53,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:53,556 INFO L225 Difference]: With dead ends: 24735 [2025-02-05 15:47:53,556 INFO L226 Difference]: Without dead ends: 16798 [2025-02-05 15:47:53,605 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-02-05 15:47:53,606 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 100 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1122 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-02-05 15:47:53,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16798 states. [2025-02-05 15:47:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16798 to 16790. [2025-02-05 15:47:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16790 states, 13978 states have (on average 1.6018743740163113) internal successors, (22391), 13983 states have internal predecessors, (22391), 2783 states have call successors, (2783), 26 states have call predecessors, (2783), 28 states have return successors, (3122), 2782 states have call predecessors, (3122), 2782 states have call successors, (3122) [2025-02-05 15:47:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16790 states to 16790 states and 28296 transitions. [2025-02-05 15:47:54,525 INFO L78 Accepts]: Start accepts. Automaton has 16790 states and 28296 transitions. Word has length 145 [2025-02-05 15:47:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:54,525 INFO L471 AbstractCegarLoop]: Abstraction has 16790 states and 28296 transitions. [2025-02-05 15:47:54,525 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 16790 states and 28296 transitions. [2025-02-05 15:47:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:47:54,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:54,581 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:47:54,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:47:54,581 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:54,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash -30922306, now seen corresponding path program 1 times [2025-02-05 15:47:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:54,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533908228] [2025-02-05 15:47:54,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:54,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:54,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:47:54,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:47:54,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:54,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:47:54,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:54,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533908228] [2025-02-05 15:47:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533908228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:54,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:54,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:54,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220542144] [2025-02-05 15:47:54,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:54,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:54,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:54,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:54,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:54,658 INFO L87 Difference]: Start difference. First operand 16790 states and 28296 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:55,290 INFO L93 Difference]: Finished difference Result 44316 states and 75044 transitions. [2025-02-05 15:47:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:55,291 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 146 [2025-02-05 15:47:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:55,394 INFO L225 Difference]: With dead ends: 44316 [2025-02-05 15:47:55,395 INFO L226 Difference]: Without dead ends: 29872 [2025-02-05 15:47:55,430 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-02-05 15:47:55,430 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 98 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1112 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-02-05 15:47:55,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29872 states. [2025-02-05 15:47:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29872 to 29864. [2025-02-05 15:47:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29864 states, 25013 states have (on average 1.5986886818854196) internal successors, (39988), 25018 states have internal predecessors, (39988), 4822 states have call successors, (4822), 26 states have call predecessors, (4822), 28 states have return successors, (5435), 4821 states have call predecessors, (5435), 4821 states have call successors, (5435) [2025-02-05 15:47:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29864 states to 29864 states and 50245 transitions. [2025-02-05 15:47:56,616 INFO L78 Accepts]: Start accepts. Automaton has 29864 states and 50245 transitions. Word has length 146 [2025-02-05 15:47:56,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:56,617 INFO L471 AbstractCegarLoop]: Abstraction has 29864 states and 50245 transitions. [2025-02-05 15:47:56,617 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 29864 states and 50245 transitions. [2025-02-05 15:47:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:47:56,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:56,666 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:47:56,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:47:56,666 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:56,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:56,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1241769836, now seen corresponding path program 1 times [2025-02-05 15:47:56,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:56,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319034462] [2025-02-05 15:47:56,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:56,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:56,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:47:56,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:47:56,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:56,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:47:56,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:56,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319034462] [2025-02-05 15:47:56,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319034462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:56,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:56,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:56,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512233265] [2025-02-05 15:47:56,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:56,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:56,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:56,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:56,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:56,731 INFO L87 Difference]: Start difference. First operand 29864 states and 50245 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:47:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:57,925 INFO L93 Difference]: Finished difference Result 81273 states and 137256 transitions. [2025-02-05 15:47:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:57,926 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-02-05 15:47:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:58,131 INFO L225 Difference]: With dead ends: 81273 [2025-02-05 15:47:58,131 INFO L226 Difference]: Without dead ends: 54558 [2025-02-05 15:47:58,193 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-02-05 15:47:58,195 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 96 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1108 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-02-05 15:47:58,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1108 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54558 states. [2025-02-05 15:47:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54558 to 54550. [2025-02-05 15:47:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54550 states, 45984 states have (on average 1.5939457202505218) internal successors, (73296), 45989 states have internal predecessors, (73296), 8537 states have call successors, (8537), 26 states have call predecessors, (8537), 28 states have return successors, (9682), 8536 states have call predecessors, (9682), 8536 states have call successors, (9682) [2025-02-05 15:48:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54550 states to 54550 states and 91515 transitions. [2025-02-05 15:48:00,047 INFO L78 Accepts]: Start accepts. Automaton has 54550 states and 91515 transitions. Word has length 147 [2025-02-05 15:48:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:00,048 INFO L471 AbstractCegarLoop]: Abstraction has 54550 states and 91515 transitions. [2025-02-05 15:48:00,048 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:48:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 54550 states and 91515 transitions. [2025-02-05 15:48:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:48:00,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:00,115 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:48:00,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:48:00,115 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:00,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:00,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1979942175, now seen corresponding path program 1 times [2025-02-05 15:48:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:00,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316872818] [2025-02-05 15:48:00,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:00,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:48:00,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:48:00,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:00,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:48:00,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:00,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316872818] [2025-02-05 15:48:00,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316872818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:00,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:00,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:00,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244528184] [2025-02-05 15:48:00,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:00,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:00,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:00,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:00,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:00,189 INFO L87 Difference]: Start difference. First operand 54550 states and 91515 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:48:02,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:02,033 INFO L93 Difference]: Finished difference Result 101819 states and 171163 transitions. [2025-02-05 15:48:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:02,034 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 148 [2025-02-05 15:48:02,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:02,691 INFO L225 Difference]: With dead ends: 101819 [2025-02-05 15:48:02,691 INFO L226 Difference]: Without dead ends: 101599 [2025-02-05 15:48:02,786 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-02-05 15:48:02,788 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 91 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1118 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-02-05 15:48:02,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101599 states. [2025-02-05 15:48:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101599 to 101591. [2025-02-05 15:48:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101591 states, 86226 states have (on average 1.5876185837218473) internal successors, (136894), 86231 states have internal predecessors, (136894), 15336 states have call successors, (15336), 26 states have call predecessors, (15336), 28 states have return successors, (17527), 15335 states have call predecessors, (17527), 15335 states have call successors, (17527) [2025-02-05 15:48:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101591 states to 101591 states and 169757 transitions. [2025-02-05 15:48:07,203 INFO L78 Accepts]: Start accepts. Automaton has 101591 states and 169757 transitions. Word has length 148 [2025-02-05 15:48:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:07,204 INFO L471 AbstractCegarLoop]: Abstraction has 101591 states and 169757 transitions. [2025-02-05 15:48:07,204 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:48:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 101591 states and 169757 transitions. [2025-02-05 15:48:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:48:07,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:07,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-05 15:48:07,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:48:07,281 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:07,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:07,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1224388117, now seen corresponding path program 1 times [2025-02-05 15:48:07,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:07,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225680142] [2025-02-05 15:48:07,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:07,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:07,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:48:07,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:48:07,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:07,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:48:08,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:08,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225680142] [2025-02-05 15:48:08,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225680142] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:08,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378181127] [2025-02-05 15:48:08,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:08,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:08,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:08,091 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:08,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:48:08,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:48:08,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:48:08,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:08,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:08,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:48:08,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 15:48:08,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:48:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:09,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378181127] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:48:09,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:48:09,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-02-05 15:48:09,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606902421] [2025-02-05 15:48:09,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:48:09,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 15:48:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:09,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 15:48:09,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-02-05 15:48:09,055 INFO L87 Difference]: Start difference. First operand 101591 states and 169757 transitions. Second operand has 28 states, 26 states have (on average 9.346153846153847) internal successors, (243), 24 states have internal predecessors, (243), 9 states have call successors, (47), 8 states have call predecessors, (47), 12 states have return successors, (42), 11 states have call predecessors, (42), 9 states have call successors, (42) [2025-02-05 15:48:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:24,926 INFO L93 Difference]: Finished difference Result 405312 states and 701215 transitions. [2025-02-05 15:48:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-02-05 15:48:24,929 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 9.346153846153847) internal successors, (243), 24 states have internal predecessors, (243), 9 states have call successors, (47), 8 states have call predecessors, (47), 12 states have return successors, (42), 11 states have call predecessors, (42), 9 states have call successors, (42) Word has length 149 [2025-02-05 15:48:24,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:26,687 INFO L225 Difference]: With dead ends: 405312 [2025-02-05 15:48:26,688 INFO L226 Difference]: Without dead ends: 405100 [2025-02-05 15:48:26,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3484 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1363, Invalid=11293, Unknown=0, NotChecked=0, Total=12656 [2025-02-05 15:48:26,840 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 6992 mSDsluCounter, 5049 mSDsCounter, 0 mSdLazyCounter, 13761 mSolverCounterSat, 2253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7053 SdHoareTripleChecker+Valid, 5288 SdHoareTripleChecker+Invalid, 16014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2253 IncrementalHoareTripleChecker+Valid, 13761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:26,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7053 Valid, 5288 Invalid, 16014 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2253 Valid, 13761 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-02-05 15:48:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405100 states.