./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_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_spec27_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 3f09e5adfeee9c308429dc6a96730836c8dd32d7c1bd2833eb57924261e76e35 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:43:22,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:43:22,436 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:43:22,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:43:22,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:43:22,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:43:22,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:43:22,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:43:22,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:43:22,457 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:43:22,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:43:22,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:43:22,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:43:22,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:43:22,458 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:43:22,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:43:22,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:43:22,459 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:43:22,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:43:22,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:43:22,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:43:22,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:43:22,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:43:22,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:43:22,459 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:43:22,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:43:22,459 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:43:22,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:43:22,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:43:22,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:43:22,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:43:22,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:43:22,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:43:22,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:43:22,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:43:22,460 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:43:22,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:43:22,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:43:22,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:43:22,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:43:22,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:43:22,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:43:22,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:43:22,461 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 -> 3f09e5adfeee9c308429dc6a96730836c8dd32d7c1bd2833eb57924261e76e35 [2025-02-05 15:43:22,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:43:22,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:43:22,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:43:22,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:43:22,702 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:43:22,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product33.cil.c [2025-02-05 15:43:24,645 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbd7c5d88/eb20e3bd3adf41349af603f50deb89f7/FLAG22652fa06 [2025-02-05 15:43:24,988 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:43:24,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product33.cil.c [2025-02-05 15:43:25,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbd7c5d88/eb20e3bd3adf41349af603f50deb89f7/FLAG22652fa06 [2025-02-05 15:43:25,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbd7c5d88/eb20e3bd3adf41349af603f50deb89f7 [2025-02-05 15:43:25,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:43:25,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:43:25,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:43:25,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:43:25,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:43:25,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:43:25" (1/1) ... [2025-02-05 15:43:25,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5caa8ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25, skipping insertion in model container [2025-02-05 15:43:25,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:43:25" (1/1) ... [2025-02-05 15:43:25,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:43:25,418 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_spec27_product33.cil.c[1543,1556] [2025-02-05 15:43:25,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:43:25,762 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:43:25,769 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-02-05 15:43:25,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [57] [2025-02-05 15:43:25,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [75] [2025-02-05 15:43:25,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [441] [2025-02-05 15:43:25,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [767] [2025-02-05 15:43:25,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [915] [2025-02-05 15:43:25,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [1134] [2025-02-05 15:43:25,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1166] [2025-02-05 15:43:25,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1201] [2025-02-05 15:43:25,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1603] [2025-02-05 15:43:25,773 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2673] [2025-02-05 15:43:25,775 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_spec27_product33.cil.c[1543,1556] [2025-02-05 15:43:25,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:43:25,868 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:43:25,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25 WrapperNode [2025-02-05 15:43:25,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:43:25,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:43:25,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:43:25,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:43:25,875 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:43:25" (1/1) ... [2025-02-05 15:43:25,891 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:43:25" (1/1) ... [2025-02-05 15:43:25,936 INFO L138 Inliner]: procedures = 134, calls = 213, calls flagged for inlining = 64, calls inlined = 59, statements flattened = 1068 [2025-02-05 15:43:25,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:43:25,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:43:25,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:43:25,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:43:25,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25" (1/1) ... [2025-02-05 15:43:25,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25" (1/1) ... [2025-02-05 15:43:25,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25" (1/1) ... [2025-02-05 15:43:25,963 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:43:25,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25" (1/1) ... [2025-02-05 15:43:25,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25" (1/1) ... [2025-02-05 15:43:25,974 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25" (1/1) ... [2025-02-05 15:43:25,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25" (1/1) ... [2025-02-05 15:43:25,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25" (1/1) ... [2025-02-05 15:43:25,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25" (1/1) ... [2025-02-05 15:43:25,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:43:25,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:43:25,983 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:43:25,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:43:25,984 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25" (1/1) ... [2025-02-05 15:43:25,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:43:26,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:26,031 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:43:26,043 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:43:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:43:26,059 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:43:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:43:26,059 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:43:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:43:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:43:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:43:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:43:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:43:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:43:26,061 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:43:26,061 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:43:26,061 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:43:26,062 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:43:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:43:26,062 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:43:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:43:26,062 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:43:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:43:26,062 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:43:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:43:26,063 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:43:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:43:26,063 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:43:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:43:26,063 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:43:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:43:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:43:26,063 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:43:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:43:26,063 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:43:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:43:26,064 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:43:26,064 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:43:26,065 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:43:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:43:26,065 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:43:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-02-05 15:43:26,065 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-02-05 15:43:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:43:26,065 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:43:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:43:26,065 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:43:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:43:26,065 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:43:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:43:26,065 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:43:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:43:26,066 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:43:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:43:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:43:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:43:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:43:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:43:26,066 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:43:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:43:26,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:43:26,236 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:43:26,238 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:43:26,530 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2168-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~30#1; [2025-02-05 15:43:26,530 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2650-1: getClientId_#res#1 := getClientId_~retValue_acc~38#1; [2025-02-05 15:43:26,530 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1247-1: getEmailId_#res#1 := getEmailId_~retValue_acc~12#1; [2025-02-05 15:43:26,531 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2603-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~37#1; [2025-02-05 15:43:26,539 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1510: #res := ~retValue_acc~19; [2025-02-05 15:43:26,546 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1584: #res := ~retValue_acc~21; [2025-02-05 15:43:26,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: #res := ~retValue_acc~43; [2025-02-05 15:43:26,577 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2262-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~32#1; [2025-02-05 15:43:26,577 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2307: #res#1 := ~retValue_acc~33#1; [2025-02-05 15:43:26,593 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: #res := ~retValue_acc~36; [2025-02-05 15:43:26,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2215: #res := ~retValue_acc~31; [2025-02-05 15:43:26,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L912-1: createEmail_#res#1 := createEmail_~retValue_acc~8#1; [2025-02-05 15:43:26,614 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1436: #res := ~retValue_acc~17; [2025-02-05 15:43:26,623 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1473: #res := ~retValue_acc~18; [2025-02-05 15:43:26,628 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1547: #res := ~retValue_acc~20; [2025-02-05 15:43:26,643 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1321: #res := ~retValue_acc~14; [2025-02-05 15:43:26,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~42#1; [2025-02-05 15:43:26,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2477-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~35#1; [2025-02-05 15:43:26,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2370-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~34#1; [2025-02-05 15:43:26,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1198-1: valid_product_#res#1 := valid_product_~retValue_acc~10#1; [2025-02-05 15:43:26,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2908-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~40#1; [2025-02-05 15:43:26,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2917-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~41#1; [2025-02-05 15:43:26,942 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1284: #res := ~retValue_acc~13; [2025-02-05 15:43:26,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L888: #res#1 := ~retValue_acc~6#1; [2025-02-05 15:43:26,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L868-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~5#1; [2025-02-05 15:43:27,073 INFO L? ?]: Removed 499 outVars from TransFormulas that were not future-live. [2025-02-05 15:43:27,073 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:43:27,085 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:43:27,085 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:43:27,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:43:27 BoogieIcfgContainer [2025-02-05 15:43:27,086 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:43:27,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:43:27,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:43:27,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:43:27,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:43:25" (1/3) ... [2025-02-05 15:43:27,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a00cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:43:27, skipping insertion in model container [2025-02-05 15:43:27,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:25" (2/3) ... [2025-02-05 15:43:27,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a00cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:43:27, skipping insertion in model container [2025-02-05 15:43:27,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:43:27" (3/3) ... [2025-02-05 15:43:27,093 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product33.cil.c [2025-02-05 15:43:27,102 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:43:27,105 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product33.cil.c that has 26 procedures, 393 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:43:27,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:43:27,213 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;@1c1d84cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:43:27,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:43:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 393 states, 301 states have (on average 1.495016611295681) internal successors, (450), 305 states have internal predecessors, (450), 65 states have call successors, (65), 25 states have call predecessors, (65), 25 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-05 15:43:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:43:27,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:27,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:27,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:27,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:27,248 INFO L85 PathProgramCache]: Analyzing trace with hash 163975871, now seen corresponding path program 1 times [2025-02-05 15:43:27,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:27,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285843498] [2025-02-05 15:43:27,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:27,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:43:27,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:43:27,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:27,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 15:43:27,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:27,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285843498] [2025-02-05 15:43:27,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285843498] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:27,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492730038] [2025-02-05 15:43:27,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:27,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:27,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:27,959 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:43:27,961 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:43:28,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:43:28,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:43:28,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:28,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:28,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:43:28,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 15:43:28,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492730038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:43:28,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945199797] [2025-02-05 15:43:28,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:28,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:43:28,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:28,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:43:28,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:28,316 INFO L87 Difference]: Start difference. First operand has 393 states, 301 states have (on average 1.495016611295681) internal successors, (450), 305 states have internal predecessors, (450), 65 states have call successors, (65), 25 states have call predecessors, (65), 25 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:28,354 INFO L93 Difference]: Finished difference Result 628 states and 908 transitions. [2025-02-05 15:43:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:43:28,355 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 142 [2025-02-05 15:43:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:28,363 INFO L225 Difference]: With dead ends: 628 [2025-02-05 15:43:28,363 INFO L226 Difference]: Without dead ends: 386 [2025-02-05 15:43:28,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 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:43:28,368 INFO L435 NwaCegarLoop]: 577 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, 577 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:43:28,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-02-05 15:43:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-02-05 15:43:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 295 states have (on average 1.4915254237288136) internal successors, (440), 298 states have internal predecessors, (440), 65 states have call successors, (65), 25 states have call predecessors, (65), 25 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-05 15:43:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 569 transitions. [2025-02-05 15:43:28,420 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 569 transitions. Word has length 142 [2025-02-05 15:43:28,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:28,421 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 569 transitions. [2025-02-05 15:43:28,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 569 transitions. [2025-02-05 15:43:28,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 15:43:28,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:28,426 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:28,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:43:28,626 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:43:28,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:28,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash 19652780, now seen corresponding path program 1 times [2025-02-05 15:43:28,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:28,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913815761] [2025-02-05 15:43:28,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:28,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:28,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:43:28,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:43:28,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:28,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 15:43:28,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:28,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913815761] [2025-02-05 15:43:28,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913815761] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:28,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860030589] [2025-02-05 15:43:28,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:28,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:28,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:28,865 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:43:28,866 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:43:29,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:43:29,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:43:29,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:29,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:29,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:43:29,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 15:43:29,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:29,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860030589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:29,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:29,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:43:29,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942322410] [2025-02-05 15:43:29,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:29,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:29,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:29,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:29,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:43:29,196 INFO L87 Difference]: Start difference. First operand 386 states and 569 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:29,241 INFO L93 Difference]: Finished difference Result 617 states and 889 transitions. [2025-02-05 15:43:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:29,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 143 [2025-02-05 15:43:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:29,247 INFO L225 Difference]: With dead ends: 617 [2025-02-05 15:43:29,247 INFO L226 Difference]: Without dead ends: 388 [2025-02-05 15:43:29,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 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:43:29,249 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1134 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:43:29,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1134 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-05 15:43:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-02-05 15:43:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 297 states have (on average 1.4882154882154883) internal successors, (442), 300 states have internal predecessors, (442), 65 states have call successors, (65), 25 states have call predecessors, (65), 25 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-05 15:43:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 571 transitions. [2025-02-05 15:43:29,269 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 571 transitions. Word has length 143 [2025-02-05 15:43:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:29,269 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 571 transitions. [2025-02-05 15:43:29,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 571 transitions. [2025-02-05 15:43:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:43:29,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:29,273 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:29,281 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:43:29,474 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:43:29,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:29,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:29,475 INFO L85 PathProgramCache]: Analyzing trace with hash -41820848, now seen corresponding path program 1 times [2025-02-05 15:43:29,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:29,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395797969] [2025-02-05 15:43:29,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:29,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:29,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:43:29,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:43:29,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:29,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:43:29,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:29,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395797969] [2025-02-05 15:43:29,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395797969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:29,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369988045] [2025-02-05 15:43:29,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:29,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:29,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:29,791 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:43:29,792 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:43:29,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:43:30,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:43:30,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:30,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:30,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:43:30,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 15:43:30,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369988045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:30,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:30,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:43:30,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500359730] [2025-02-05 15:43:30,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:30,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:30,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:30,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:30,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:43:30,078 INFO L87 Difference]: Start difference. First operand 388 states and 571 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:30,121 INFO L93 Difference]: Finished difference Result 810 states and 1208 transitions. [2025-02-05 15:43:30,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:30,123 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-02-05 15:43:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:30,126 INFO L225 Difference]: With dead ends: 810 [2025-02-05 15:43:30,126 INFO L226 Difference]: Without dead ends: 449 [2025-02-05 15:43:30,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 151 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:43:30,131 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 115 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1107 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:43:30,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1107 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:30,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-02-05 15:43:30,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 441. [2025-02-05 15:43:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 339 states have (on average 1.5073746312684366) internal successors, (511), 342 states have internal predecessors, (511), 76 states have call successors, (76), 25 states have call predecessors, (76), 25 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-05 15:43:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 662 transitions. [2025-02-05 15:43:30,165 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 662 transitions. Word has length 151 [2025-02-05 15:43:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:30,165 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 662 transitions. [2025-02-05 15:43:30,166 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 662 transitions. [2025-02-05 15:43:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 15:43:30,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:30,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:30,183 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:43:30,372 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:43:30,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:30,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:30,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1795426819, now seen corresponding path program 1 times [2025-02-05 15:43:30,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:30,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659130345] [2025-02-05 15:43:30,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:30,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:30,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:43:30,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:43:30,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:30,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:43:30,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:30,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659130345] [2025-02-05 15:43:30,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659130345] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:30,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801235621] [2025-02-05 15:43:30,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:30,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:30,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:30,577 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:43:30,582 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:43:30,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:43:30,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:43:30,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:30,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:30,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:43:30,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:43:30,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:30,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801235621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:30,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:30,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:43:30,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740791628] [2025-02-05 15:43:30,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:30,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:30,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:30,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:30,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:43:30,891 INFO L87 Difference]: Start difference. First operand 441 states and 662 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:43:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:30,969 INFO L93 Difference]: Finished difference Result 873 states and 1314 transitions. [2025-02-05 15:43:30,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:30,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 152 [2025-02-05 15:43:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:30,972 INFO L225 Difference]: With dead ends: 873 [2025-02-05 15:43:30,972 INFO L226 Difference]: Without dead ends: 443 [2025-02-05 15:43:30,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 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:43:30,973 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 2 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2233 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:43:30,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2233 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-02-05 15:43:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2025-02-05 15:43:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 340 states have (on average 1.5058823529411764) internal successors, (512), 344 states have internal predecessors, (512), 76 states have call successors, (76), 25 states have call predecessors, (76), 26 states have return successors, (77), 75 states have call predecessors, (77), 75 states have call successors, (77) [2025-02-05 15:43:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 665 transitions. [2025-02-05 15:43:30,989 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 665 transitions. Word has length 152 [2025-02-05 15:43:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:30,989 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 665 transitions. [2025-02-05 15:43:30,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:43:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 665 transitions. [2025-02-05 15:43:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 15:43:30,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:30,992 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:31,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:43:31,192 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:43:31,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:31,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:31,194 INFO L85 PathProgramCache]: Analyzing trace with hash -158591292, now seen corresponding path program 1 times [2025-02-05 15:43:31,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:31,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739099549] [2025-02-05 15:43:31,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:31,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:31,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 15:43:31,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:43:31,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:31,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:43:31,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:31,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739099549] [2025-02-05 15:43:31,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739099549] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:31,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869197411] [2025-02-05 15:43:31,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:31,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:31,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:31,380 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:43:31,389 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:43:31,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 15:43:31,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:43:31,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:31,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:31,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:43:31,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:43:31,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:31,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869197411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:31,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:31,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:43:31,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984560245] [2025-02-05 15:43:31,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:31,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:31,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:31,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:31,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:43:31,690 INFO L87 Difference]: Start difference. First operand 443 states and 665 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:43:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:31,751 INFO L93 Difference]: Finished difference Result 875 states and 1319 transitions. [2025-02-05 15:43:31,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:31,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-02-05 15:43:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:31,755 INFO L225 Difference]: With dead ends: 875 [2025-02-05 15:43:31,755 INFO L226 Difference]: Without dead ends: 445 [2025-02-05 15:43:31,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 151 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:43:31,757 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 2 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2219 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:43:31,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2219 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-02-05 15:43:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-02-05 15:43:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 341 states have (on average 1.5043988269794721) internal successors, (513), 346 states have internal predecessors, (513), 76 states have call successors, (76), 25 states have call predecessors, (76), 27 states have return successors, (82), 75 states have call predecessors, (82), 75 states have call successors, (82) [2025-02-05 15:43:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 671 transitions. [2025-02-05 15:43:31,772 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 671 transitions. Word has length 153 [2025-02-05 15:43:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:31,773 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 671 transitions. [2025-02-05 15:43:31,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:43:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 671 transitions. [2025-02-05 15:43:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 15:43:31,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:31,775 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:31,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:43:31,975 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:43:31,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:31,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:31,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2003102705, now seen corresponding path program 1 times [2025-02-05 15:43:31,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:31,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244636783] [2025-02-05 15:43:31,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:31,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:32,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 15:43:32,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 15:43:32,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:32,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:43:32,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244636783] [2025-02-05 15:43:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244636783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:32,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:32,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:43:32,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138153824] [2025-02-05 15:43:32,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:32,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:32,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:32,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:32,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:32,137 INFO L87 Difference]: Start difference. First operand 445 states and 671 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:43:32,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:32,175 INFO L93 Difference]: Finished difference Result 867 states and 1310 transitions. [2025-02-05 15:43:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:32,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 154 [2025-02-05 15:43:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:32,178 INFO L225 Difference]: With dead ends: 867 [2025-02-05 15:43:32,178 INFO L226 Difference]: Without dead ends: 445 [2025-02-05 15:43:32,179 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:43:32,180 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 2 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2237 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:43:32,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2237 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-02-05 15:43:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-02-05 15:43:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 341 states have (on average 1.5043988269794721) internal successors, (513), 346 states have internal predecessors, (513), 76 states have call successors, (76), 25 states have call predecessors, (76), 27 states have return successors, (81), 75 states have call predecessors, (81), 75 states have call successors, (81) [2025-02-05 15:43:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 670 transitions. [2025-02-05 15:43:32,195 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 670 transitions. Word has length 154 [2025-02-05 15:43:32,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:32,195 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 670 transitions. [2025-02-05 15:43:32,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:43:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 670 transitions. [2025-02-05 15:43:32,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 15:43:32,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:32,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:43:32,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:43:32,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:32,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:32,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1173174860, now seen corresponding path program 2 times [2025-02-05 15:43:32,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:32,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218944485] [2025-02-05 15:43:32,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:43:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:32,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 155 statements into 2 equivalence classes. [2025-02-05 15:43:32,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 81 of 155 statements. [2025-02-05 15:43:32,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:43:32,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:43:32,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:32,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218944485] [2025-02-05 15:43:32,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218944485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:32,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:32,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:43:32,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447009504] [2025-02-05 15:43:32,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:32,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:43:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:32,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:43:32,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:43:32,413 INFO L87 Difference]: Start difference. First operand 445 states and 670 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:43:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:32,905 INFO L93 Difference]: Finished difference Result 1192 states and 1780 transitions. [2025-02-05 15:43:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:43:32,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-02-05 15:43:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:32,911 INFO L225 Difference]: With dead ends: 1192 [2025-02-05 15:43:32,911 INFO L226 Difference]: Without dead ends: 971 [2025-02-05 15:43:32,912 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:43:32,913 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 660 mSDsluCounter, 3306 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 3906 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:32,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 3906 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:43:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-02-05 15:43:32,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 871. [2025-02-05 15:43:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 671 states have (on average 1.5126676602086437) internal successors, (1015), 678 states have internal predecessors, (1015), 146 states have call successors, (146), 50 states have call predecessors, (146), 53 states have return successors, (159), 146 states have call predecessors, (159), 144 states have call successors, (159) [2025-02-05 15:43:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1320 transitions. [2025-02-05 15:43:32,990 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1320 transitions. Word has length 155 [2025-02-05 15:43:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:32,990 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1320 transitions. [2025-02-05 15:43:32,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:43:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1320 transitions. [2025-02-05 15:43:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 15:43:32,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:32,994 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:32,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:43:32,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:32,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:32,995 INFO L85 PathProgramCache]: Analyzing trace with hash -658245444, now seen corresponding path program 1 times [2025-02-05 15:43:32,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:32,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962886041] [2025-02-05 15:43:32,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:32,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:33,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 15:43:33,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 15:43:33,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:33,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:43:33,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:33,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962886041] [2025-02-05 15:43:33,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962886041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:33,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:33,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:43:33,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537883646] [2025-02-05 15:43:33,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:33,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:33,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:33,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:33,164 INFO L87 Difference]: Start difference. First operand 871 states and 1320 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:43:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:33,209 INFO L93 Difference]: Finished difference Result 1721 states and 2613 transitions. [2025-02-05 15:43:33,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:33,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 156 [2025-02-05 15:43:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:33,213 INFO L225 Difference]: With dead ends: 1721 [2025-02-05 15:43:33,213 INFO L226 Difference]: Without dead ends: 873 [2025-02-05 15:43:33,215 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:43:33,216 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 1 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2240 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:43:33,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2240 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-05 15:43:33,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-05 15:43:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 672 states have (on average 1.5119047619047619) internal successors, (1016), 680 states have internal predecessors, (1016), 146 states have call successors, (146), 50 states have call predecessors, (146), 54 states have return successors, (161), 146 states have call predecessors, (161), 144 states have call successors, (161) [2025-02-05 15:43:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1323 transitions. [2025-02-05 15:43:33,245 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1323 transitions. Word has length 156 [2025-02-05 15:43:33,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:33,245 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1323 transitions. [2025-02-05 15:43:33,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:43:33,246 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1323 transitions. [2025-02-05 15:43:33,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 15:43:33,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:33,249 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:33,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:43:33,249 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:33,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:33,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1814554652, now seen corresponding path program 1 times [2025-02-05 15:43:33,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:33,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396625684] [2025-02-05 15:43:33,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:33,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:33,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 15:43:33,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 15:43:33,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:33,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:43:33,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396625684] [2025-02-05 15:43:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396625684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:33,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:33,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:43:33,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649503501] [2025-02-05 15:43:33,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:33,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:43:33,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:33,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:43:33,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:43:33,373 INFO L87 Difference]: Start difference. First operand 873 states and 1323 transitions. Second operand has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 15:43:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:33,476 INFO L93 Difference]: Finished difference Result 1293 states and 1958 transitions. [2025-02-05 15:43:33,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:43:33,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 157 [2025-02-05 15:43:33,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:33,479 INFO L225 Difference]: With dead ends: 1293 [2025-02-05 15:43:33,479 INFO L226 Difference]: Without dead ends: 449 [2025-02-05 15:43:33,481 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:43:33,482 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 7 mSDsluCounter, 3289 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3842 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:43:33,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3842 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:43:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-02-05 15:43:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2025-02-05 15:43:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 344 states have (on average 1.5) internal successors, (516), 349 states have internal predecessors, (516), 76 states have call successors, (76), 26 states have call predecessors, (76), 28 states have return successors, (82), 75 states have call predecessors, (82), 75 states have call successors, (82) [2025-02-05 15:43:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 674 transitions. [2025-02-05 15:43:33,526 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 674 transitions. Word has length 157 [2025-02-05 15:43:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:33,527 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 674 transitions. [2025-02-05 15:43:33,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 15:43:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 674 transitions. [2025-02-05 15:43:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 15:43:33,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:33,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:33,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:43:33,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:33,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash 782811717, now seen corresponding path program 1 times [2025-02-05 15:43:33,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:33,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406859625] [2025-02-05 15:43:33,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:33,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:33,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 15:43:33,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 15:43:33,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:33,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:43:33,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:33,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406859625] [2025-02-05 15:43:33,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406859625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:33,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:33,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:43:33,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80803975] [2025-02-05 15:43:33,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:33,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:43:33,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:33,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:43:33,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:43:33,680 INFO L87 Difference]: Start difference. First operand 449 states and 674 transitions. Second operand has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 15:43:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:33,797 INFO L93 Difference]: Finished difference Result 874 states and 1319 transitions. [2025-02-05 15:43:33,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:43:33,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 157 [2025-02-05 15:43:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:33,800 INFO L225 Difference]: With dead ends: 874 [2025-02-05 15:43:33,800 INFO L226 Difference]: Without dead ends: 452 [2025-02-05 15:43:33,802 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:43:33,802 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 5 mSDsluCounter, 3301 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3856 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:43:33,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3856 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:43:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-02-05 15:43:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2025-02-05 15:43:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 346 states have (on average 1.4971098265895955) internal successors, (518), 352 states have internal predecessors, (518), 76 states have call successors, (76), 26 states have call predecessors, (76), 29 states have return successors, (87), 75 states have call predecessors, (87), 75 states have call successors, (87) [2025-02-05 15:43:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 681 transitions. [2025-02-05 15:43:33,816 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 681 transitions. Word has length 157 [2025-02-05 15:43:33,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:33,816 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 681 transitions. [2025-02-05 15:43:33,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 15:43:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 681 transitions. [2025-02-05 15:43:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 15:43:33,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:33,819 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:33,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:43:33,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:33,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash -630310071, now seen corresponding path program 1 times [2025-02-05 15:43:33,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:33,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093763593] [2025-02-05 15:43:33,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:33,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:33,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 15:43:33,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 15:43:33,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:33,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:43:33,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:33,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093763593] [2025-02-05 15:43:33,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093763593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:33,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039237661] [2025-02-05 15:43:33,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:33,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:33,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:33,994 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:43:33,996 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:43:34,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 15:43:34,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 15:43:34,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:34,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:34,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:43:34,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:43:34,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:43:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:43:34,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039237661] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:43:34,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:43:34,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:43:34,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825542645] [2025-02-05 15:43:34,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:43:34,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:43:34,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:34,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:43:34,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:43:34,455 INFO L87 Difference]: Start difference. First operand 452 states and 681 transitions. Second operand has 11 states, 10 states have (on average 15.7) internal successors, (157), 11 states have internal predecessors, (157), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-05 15:43:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:34,936 INFO L93 Difference]: Finished difference Result 1246 states and 1964 transitions. [2025-02-05 15:43:34,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:43:34,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.7) internal successors, (157), 11 states have internal predecessors, (157), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) Word has length 158 [2025-02-05 15:43:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:34,943 INFO L225 Difference]: With dead ends: 1246 [2025-02-05 15:43:34,943 INFO L226 Difference]: Without dead ends: 826 [2025-02-05 15:43:34,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 313 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:43:34,947 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 1344 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 3571 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:34,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 3571 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:43:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-02-05 15:43:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 802. [2025-02-05 15:43:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 632 states have (on average 1.5601265822784811) internal successors, (986), 637 states have internal predecessors, (986), 140 states have call successors, (140), 27 states have call predecessors, (140), 29 states have return successors, (161), 139 states have call predecessors, (161), 139 states have call successors, (161) [2025-02-05 15:43:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1287 transitions. [2025-02-05 15:43:34,989 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1287 transitions. Word has length 158 [2025-02-05 15:43:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:34,989 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1287 transitions. [2025-02-05 15:43:34,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.7) internal successors, (157), 11 states have internal predecessors, (157), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-05 15:43:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1287 transitions. [2025-02-05 15:43:34,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 15:43:34,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:34,993 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:35,002 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:43:35,194 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:43:35,194 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:35,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:35,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1611170459, now seen corresponding path program 1 times [2025-02-05 15:43:35,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:35,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499063129] [2025-02-05 15:43:35,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:35,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:35,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 15:43:35,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 15:43:35,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:35,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:43:35,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:35,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499063129] [2025-02-05 15:43:35,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499063129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:35,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:35,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:35,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120573404] [2025-02-05 15:43:35,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:35,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:35,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:35,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:35,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:35,245 INFO L87 Difference]: Start difference. First operand 802 states and 1287 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:35,304 INFO L93 Difference]: Finished difference Result 1851 states and 3024 transitions. [2025-02-05 15:43:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:35,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2025-02-05 15:43:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:35,310 INFO L225 Difference]: With dead ends: 1851 [2025-02-05 15:43:35,310 INFO L226 Difference]: Without dead ends: 1130 [2025-02-05 15:43:35,312 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:43:35,312 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 112 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1137 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:43:35,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:35,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-02-05 15:43:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1122. [2025-02-05 15:43:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 888 states have (on average 1.5833333333333333) internal successors, (1406), 893 states have internal predecessors, (1406), 204 states have call successors, (204), 27 states have call predecessors, (204), 29 states have return successors, (235), 203 states have call predecessors, (235), 203 states have call successors, (235) [2025-02-05 15:43:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1845 transitions. [2025-02-05 15:43:35,349 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1845 transitions. Word has length 161 [2025-02-05 15:43:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:35,349 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1845 transitions. [2025-02-05 15:43:35,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1845 transitions. [2025-02-05 15:43:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 15:43:35,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:35,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:35,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:43:35,354 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:35,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash 898527713, now seen corresponding path program 1 times [2025-02-05 15:43:35,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658873357] [2025-02-05 15:43:35,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:35,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 15:43:35,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 15:43:35,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:35,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:43:35,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:35,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658873357] [2025-02-05 15:43:35,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658873357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:35,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:35,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:35,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049781618] [2025-02-05 15:43:35,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:35,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:35,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:35,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:35,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:35,417 INFO L87 Difference]: Start difference. First operand 1122 states and 1845 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:35,462 INFO L93 Difference]: Finished difference Result 2645 states and 4381 transitions. [2025-02-05 15:43:35,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:35,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2025-02-05 15:43:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:35,471 INFO L225 Difference]: With dead ends: 2645 [2025-02-05 15:43:35,471 INFO L226 Difference]: Without dead ends: 1655 [2025-02-05 15:43:35,475 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:43:35,475 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 110 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1128 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:43:35,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2025-02-05 15:43:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1647. [2025-02-05 15:43:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1318 states have (on average 1.5963581183611533) internal successors, (2104), 1323 states have internal predecessors, (2104), 299 states have call successors, (299), 27 states have call predecessors, (299), 29 states have return successors, (330), 298 states have call predecessors, (330), 298 states have call successors, (330) [2025-02-05 15:43:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2733 transitions. [2025-02-05 15:43:35,534 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2733 transitions. Word has length 162 [2025-02-05 15:43:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:35,534 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2733 transitions. [2025-02-05 15:43:35,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2733 transitions. [2025-02-05 15:43:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 15:43:35,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:35,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:35,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:43:35,542 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:35,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:35,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2085676774, now seen corresponding path program 1 times [2025-02-05 15:43:35,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:35,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895543765] [2025-02-05 15:43:35,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:35,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:35,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 15:43:35,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 15:43:35,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:35,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:43:35,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:35,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895543765] [2025-02-05 15:43:35,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895543765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:35,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:35,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:35,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411585991] [2025-02-05 15:43:35,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:35,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:35,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:35,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:35,637 INFO L87 Difference]: Start difference. First operand 1647 states and 2733 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:35,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:35,704 INFO L93 Difference]: Finished difference Result 3834 states and 6415 transitions. [2025-02-05 15:43:35,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:35,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 163 [2025-02-05 15:43:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:35,719 INFO L225 Difference]: With dead ends: 3834 [2025-02-05 15:43:35,719 INFO L226 Difference]: Without dead ends: 2451 [2025-02-05 15:43:35,726 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:43:35,726 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 108 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1125 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:43:35,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1125 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:35,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-02-05 15:43:35,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2443. [2025-02-05 15:43:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 1991 states have (on average 1.6062280261175288) internal successors, (3198), 1996 states have internal predecessors, (3198), 422 states have call successors, (422), 27 states have call predecessors, (422), 29 states have return successors, (469), 421 states have call predecessors, (469), 421 states have call successors, (469) [2025-02-05 15:43:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 4089 transitions. [2025-02-05 15:43:35,836 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 4089 transitions. Word has length 163 [2025-02-05 15:43:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:35,837 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 4089 transitions. [2025-02-05 15:43:35,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 4089 transitions. [2025-02-05 15:43:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 15:43:35,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:35,850 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:35,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:43:35,850 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:35,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:35,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1622917378, now seen corresponding path program 1 times [2025-02-05 15:43:35,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:35,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430474681] [2025-02-05 15:43:35,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:35,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:35,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 15:43:35,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 15:43:35,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:35,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:43:35,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:35,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430474681] [2025-02-05 15:43:35,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430474681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:35,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:35,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:35,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538346555] [2025-02-05 15:43:35,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:35,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:35,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:35,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:35,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:35,921 INFO L87 Difference]: Start difference. First operand 2443 states and 4089 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:36,195 INFO L93 Difference]: Finished difference Result 5687 states and 9587 transitions. [2025-02-05 15:43:36,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:36,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 164 [2025-02-05 15:43:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:36,239 INFO L225 Difference]: With dead ends: 5687 [2025-02-05 15:43:36,242 INFO L226 Difference]: Without dead ends: 3723 [2025-02-05 15:43:36,258 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:43:36,258 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 106 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1125 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:43:36,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1125 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2025-02-05 15:43:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3715. [2025-02-05 15:43:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3715 states, 3084 states have (on average 1.61284046692607) internal successors, (4974), 3089 states have internal predecessors, (4974), 601 states have call successors, (601), 27 states have call predecessors, (601), 29 states have return successors, (674), 600 states have call predecessors, (674), 600 states have call successors, (674) [2025-02-05 15:43:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3715 states to 3715 states and 6249 transitions. [2025-02-05 15:43:36,659 INFO L78 Accepts]: Start accepts. Automaton has 3715 states and 6249 transitions. Word has length 164 [2025-02-05 15:43:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:36,660 INFO L471 AbstractCegarLoop]: Abstraction has 3715 states and 6249 transitions. [2025-02-05 15:43:36,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3715 states and 6249 transitions. [2025-02-05 15:43:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 15:43:36,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:36,696 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:36,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:43:36,697 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:36,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash -395689799, now seen corresponding path program 1 times [2025-02-05 15:43:36,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:36,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235113417] [2025-02-05 15:43:36,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:36,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:36,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 15:43:36,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 15:43:36,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:36,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:43:36,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:36,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235113417] [2025-02-05 15:43:36,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235113417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:36,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:36,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:36,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503798648] [2025-02-05 15:43:36,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:36,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:36,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:36,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:36,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:36,838 INFO L87 Difference]: Start difference. First operand 3715 states and 6249 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:37,151 INFO L93 Difference]: Finished difference Result 8734 states and 14795 transitions. [2025-02-05 15:43:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:37,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 165 [2025-02-05 15:43:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:37,178 INFO L225 Difference]: With dead ends: 8734 [2025-02-05 15:43:37,179 INFO L226 Difference]: Without dead ends: 5825 [2025-02-05 15:43:37,189 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:43:37,189 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 104 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1139 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:43:37,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1139 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5825 states. [2025-02-05 15:43:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5825 to 5817. [2025-02-05 15:43:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5817 states, 4810 states have (on average 1.6093555093555094) internal successors, (7741), 4815 states have internal predecessors, (7741), 977 states have call successors, (977), 27 states have call predecessors, (977), 29 states have return successors, (1094), 976 states have call predecessors, (1094), 976 states have call successors, (1094) [2025-02-05 15:43:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5817 states to 5817 states and 9812 transitions. [2025-02-05 15:43:37,496 INFO L78 Accepts]: Start accepts. Automaton has 5817 states and 9812 transitions. Word has length 165 [2025-02-05 15:43:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:37,496 INFO L471 AbstractCegarLoop]: Abstraction has 5817 states and 9812 transitions. [2025-02-05 15:43:37,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5817 states and 9812 transitions. [2025-02-05 15:43:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 15:43:37,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:37,519 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:37,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:43:37,519 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:37,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:37,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1606894045, now seen corresponding path program 1 times [2025-02-05 15:43:37,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:37,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657089262] [2025-02-05 15:43:37,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:37,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:37,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 15:43:37,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 15:43:37,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:37,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:43:37,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:37,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657089262] [2025-02-05 15:43:37,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657089262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:37,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:37,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:37,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826593647] [2025-02-05 15:43:37,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:37,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:37,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:37,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:37,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:37,568 INFO L87 Difference]: Start difference. First operand 5817 states and 9812 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:37,828 INFO L93 Difference]: Finished difference Result 14246 states and 24192 transitions. [2025-02-05 15:43:37,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:37,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 166 [2025-02-05 15:43:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:37,875 INFO L225 Difference]: With dead ends: 14246 [2025-02-05 15:43:37,875 INFO L226 Difference]: Without dead ends: 9631 [2025-02-05 15:43:37,892 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:43:37,893 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 102 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1130 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:43:37,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:37,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9631 states. [2025-02-05 15:43:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9631 to 9623. [2025-02-05 15:43:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9623 states, 8010 states have (on average 1.6089887640449438) internal successors, (12888), 8015 states have internal predecessors, (12888), 1583 states have call successors, (1583), 27 states have call predecessors, (1583), 29 states have return successors, (1778), 1582 states have call predecessors, (1778), 1582 states have call successors, (1778) [2025-02-05 15:43:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9623 states to 9623 states and 16249 transitions. [2025-02-05 15:43:38,367 INFO L78 Accepts]: Start accepts. Automaton has 9623 states and 16249 transitions. Word has length 166 [2025-02-05 15:43:38,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:38,368 INFO L471 AbstractCegarLoop]: Abstraction has 9623 states and 16249 transitions. [2025-02-05 15:43:38,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 9623 states and 16249 transitions. [2025-02-05 15:43:38,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 15:43:38,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:38,412 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:38,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:43:38,412 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:38,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash -904971656, now seen corresponding path program 1 times [2025-02-05 15:43:38,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:38,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625461822] [2025-02-05 15:43:38,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:38,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:38,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 15:43:38,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 15:43:38,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:38,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:43:38,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:38,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625461822] [2025-02-05 15:43:38,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625461822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:38,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:38,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:38,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917704116] [2025-02-05 15:43:38,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:38,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:38,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:38,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:38,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:38,463 INFO L87 Difference]: Start difference. First operand 9623 states and 16249 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:38,878 INFO L93 Difference]: Finished difference Result 24753 states and 41990 transitions. [2025-02-05 15:43:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:38,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 167 [2025-02-05 15:43:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:38,944 INFO L225 Difference]: With dead ends: 24753 [2025-02-05 15:43:38,944 INFO L226 Difference]: Without dead ends: 16807 [2025-02-05 15:43:38,978 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:43:38,978 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 100 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1145 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:43:38,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16807 states. [2025-02-05 15:43:39,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16807 to 16799. [2025-02-05 15:43:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16799 states, 13983 states have (on average 1.601730672960023) internal successors, (22397), 13988 states have internal predecessors, (22397), 2786 states have call successors, (2786), 27 states have call predecessors, (2786), 29 states have return successors, (3125), 2785 states have call predecessors, (3125), 2785 states have call successors, (3125) [2025-02-05 15:43:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16799 states to 16799 states and 28308 transitions. [2025-02-05 15:43:39,877 INFO L78 Accepts]: Start accepts. Automaton has 16799 states and 28308 transitions. Word has length 167 [2025-02-05 15:43:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:39,877 INFO L471 AbstractCegarLoop]: Abstraction has 16799 states and 28308 transitions. [2025-02-05 15:43:39,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16799 states and 28308 transitions. [2025-02-05 15:43:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 15:43:39,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:39,925 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:39,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:43:39,925 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:39,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:39,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1267700420, now seen corresponding path program 1 times [2025-02-05 15:43:39,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:39,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427183774] [2025-02-05 15:43:39,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:39,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:39,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:43:39,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:43:39,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:39,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:43:39,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:39,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427183774] [2025-02-05 15:43:39,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427183774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:39,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:39,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:39,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018943095] [2025-02-05 15:43:39,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:39,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:39,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:39,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:39,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:39,973 INFO L87 Difference]: Start difference. First operand 16799 states and 28308 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:40,634 INFO L93 Difference]: Finished difference Result 44334 states and 75068 transitions. [2025-02-05 15:43:40,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:40,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 168 [2025-02-05 15:43:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:40,733 INFO L225 Difference]: With dead ends: 44334 [2025-02-05 15:43:40,734 INFO L226 Difference]: Without dead ends: 29881 [2025-02-05 15:43:40,763 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:43:40,763 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 98 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:40,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:43:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29881 states. [2025-02-05 15:43:41,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29881 to 29873. [2025-02-05 15:43:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29873 states, 25018 states have (on average 1.5986090015189063) internal successors, (39994), 25023 states have internal predecessors, (39994), 4825 states have call successors, (4825), 27 states have call predecessors, (4825), 29 states have return successors, (5438), 4824 states have call predecessors, (5438), 4824 states have call successors, (5438) [2025-02-05 15:43:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29873 states to 29873 states and 50257 transitions. [2025-02-05 15:43:41,842 INFO L78 Accepts]: Start accepts. Automaton has 29873 states and 50257 transitions. Word has length 168 [2025-02-05 15:43:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:41,843 INFO L471 AbstractCegarLoop]: Abstraction has 29873 states and 50257 transitions. [2025-02-05 15:43:41,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 29873 states and 50257 transitions. [2025-02-05 15:43:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 15:43:41,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:41,920 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:41,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:43:41,920 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:41,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2089000105, now seen corresponding path program 1 times [2025-02-05 15:43:41,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:41,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248591842] [2025-02-05 15:43:41,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:41,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:41,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 15:43:41,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 15:43:41,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:41,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:43:41,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:41,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248591842] [2025-02-05 15:43:41,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248591842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:41,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:41,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359269923] [2025-02-05 15:43:41,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:41,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:41,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:41,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:41,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:41,992 INFO L87 Difference]: Start difference. First operand 29873 states and 50257 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:43,275 INFO L93 Difference]: Finished difference Result 81291 states and 137280 transitions. [2025-02-05 15:43:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:43,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 169 [2025-02-05 15:43:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:43,526 INFO L225 Difference]: With dead ends: 81291 [2025-02-05 15:43:43,526 INFO L226 Difference]: Without dead ends: 54567 [2025-02-05 15:43:43,626 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:43:43,629 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 96 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1132 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:43:43,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54567 states. [2025-02-05 15:43:45,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54567 to 54559. [2025-02-05 15:43:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54559 states, 45989 states have (on average 1.593902889821479) internal successors, (73302), 45994 states have internal predecessors, (73302), 8540 states have call successors, (8540), 27 states have call predecessors, (8540), 29 states have return successors, (9685), 8539 states have call predecessors, (9685), 8539 states have call successors, (9685) [2025-02-05 15:43:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54559 states to 54559 states and 91527 transitions. [2025-02-05 15:43:45,945 INFO L78 Accepts]: Start accepts. Automaton has 54559 states and 91527 transitions. Word has length 169 [2025-02-05 15:43:45,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:45,945 INFO L471 AbstractCegarLoop]: Abstraction has 54559 states and 91527 transitions. [2025-02-05 15:43:45,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 54559 states and 91527 transitions. [2025-02-05 15:43:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 15:43:46,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:46,036 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:46,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:43:46,036 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:46,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash 709159941, now seen corresponding path program 1 times [2025-02-05 15:43:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:46,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452508878] [2025-02-05 15:43:46,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:46,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:46,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 15:43:46,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 15:43:46,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:46,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:43:46,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:46,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452508878] [2025-02-05 15:43:46,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452508878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:46,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:46,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:46,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488605553] [2025-02-05 15:43:46,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:46,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:46,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:46,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:46,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:46,087 INFO L87 Difference]: Start difference. First operand 54559 states and 91527 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:48,094 INFO L93 Difference]: Finished difference Result 101837 states and 171187 transitions. [2025-02-05 15:43:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:48,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 170 [2025-02-05 15:43:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:48,475 INFO L225 Difference]: With dead ends: 101837 [2025-02-05 15:43:48,476 INFO L226 Difference]: Without dead ends: 101608 [2025-02-05 15:43:48,528 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:43:48,529 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 91 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1142 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:43:48,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1142 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101608 states. [2025-02-05 15:43:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101608 to 101600. [2025-02-05 15:43:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101600 states, 86231 states have (on average 1.5875961081281673) internal successors, (136900), 86236 states have internal predecessors, (136900), 15339 states have call successors, (15339), 27 states have call predecessors, (15339), 29 states have return successors, (17530), 15338 states have call predecessors, (17530), 15338 states have call successors, (17530) [2025-02-05 15:43:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101600 states to 101600 states and 169769 transitions. [2025-02-05 15:43:52,647 INFO L78 Accepts]: Start accepts. Automaton has 101600 states and 169769 transitions. Word has length 170 [2025-02-05 15:43:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:52,647 INFO L471 AbstractCegarLoop]: Abstraction has 101600 states and 169769 transitions. [2025-02-05 15:43:52,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 101600 states and 169769 transitions. [2025-02-05 15:43:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 15:43:52,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:52,777 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:52,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:43:52,778 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:52,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:52,778 INFO L85 PathProgramCache]: Analyzing trace with hash 765311990, now seen corresponding path program 1 times [2025-02-05 15:43:52,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:52,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622913324] [2025-02-05 15:43:52,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:52,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:52,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 15:43:52,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 15:43:52,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:52,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:43:53,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:53,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622913324] [2025-02-05 15:43:53,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622913324] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:53,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174263118] [2025-02-05 15:43:53,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:53,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:53,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:53,102 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:43:53,105 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:43:53,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 15:43:53,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 15:43:53,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:53,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:53,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:43:53,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:43:53,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:43:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:43:53,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174263118] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:43:53,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:43:53,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-02-05 15:43:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501256495] [2025-02-05 15:43:53,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:43:53,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 15:43:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:53,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 15:43:53,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-02-05 15:43:53,983 INFO L87 Difference]: Start difference. First operand 101600 states and 169769 transitions. Second operand has 28 states, 26 states have (on average 10.038461538461538) internal successors, (261), 24 states have internal predecessors, (261), 9 states have call successors, (53), 8 states have call predecessors, (53), 12 states have return successors, (48), 11 states have call predecessors, (48), 9 states have call successors, (48) [2025-02-05 15:44:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:08,780 INFO L93 Difference]: Finished difference Result 405381 states and 701323 transitions. [2025-02-05 15:44:08,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-02-05 15:44:08,781 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 10.038461538461538) internal successors, (261), 24 states have internal predecessors, (261), 9 states have call successors, (53), 8 states have call predecessors, (53), 12 states have return successors, (48), 11 states have call predecessors, (48), 9 states have call successors, (48) Word has length 171 [2025-02-05 15:44:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:11,410 INFO L225 Difference]: With dead ends: 405381 [2025-02-05 15:44:11,411 INFO L226 Difference]: Without dead ends: 405160 [2025-02-05 15:44:11,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3484 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1363, Invalid=11293, Unknown=0, NotChecked=0, Total=12656 [2025-02-05 15:44:11,594 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 6346 mSDsluCounter, 5255 mSDsCounter, 0 mSdLazyCounter, 12900 mSolverCounterSat, 2160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6411 SdHoareTripleChecker+Valid, 5494 SdHoareTripleChecker+Invalid, 15060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2160 IncrementalHoareTripleChecker+Valid, 12900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:11,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6411 Valid, 5494 Invalid, 15060 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2160 Valid, 12900 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-02-05 15:44:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405160 states.